scholarly journals Efficient Allocation of Customers to Facilities in the Multi-Objective Sustainable Location Problem

2020 ◽  
Vol 12 (18) ◽  
pp. 7634
Author(s):  
Xifeng Tang ◽  
Jiantao Wu ◽  
Rui Li
Keyword(s):  
Location Problem ◽  
Computation Time ◽  
Allocation Rule ◽  
Nsga Ii ◽  
Solution Quality ◽  
Allocation Rules ◽  
Location Allocation ◽  
Multi Objective ◽  
Sustainable Logistics ◽  
The Impact

This paper aims to evaluate the impact of customer allocation on the facility location in the multi-objective location problem for sustainable logistics. After a new practical multi-objective location model considering vehicle carbon emissions is introduced, the NSGA-II and SEAMO2 algorithms are employed to solve the model. Within the framework of each algorithm, three different allocation rules derived from the optimization of customer allocation based on distance, cost, and emissions are separately applied to perform the customer-to-facility assignment so as to evaluate their impacts. The results of extensive computational experiments show that the allocation rules have nearly no influence on the solution quality, and the allocation rule based on the distance has an absolute advantage of computation time. These findings will greatly help to simplify the location-allocation analysis in the multi-objective location problems.

Fuzzy multi-objective location and routing problem

2020 ◽  
Vol 39 (3) ◽  
pp. 3259-3273
Author(s):  
Nasser Shahsavari-Pour ◽  
Najmeh Bahram-Pour ◽  
Mojde Kazemi
Keyword(s):  
Firefly Algorithm ◽  
High Reliability ◽  
Research Area ◽  
Nsga Ii ◽  
Location Routing Problem ◽  
Routing Problem ◽  
Location Allocation ◽  
Multi Objective ◽  
Location Routing ◽  
The Cost

The location-routing problem is a research area that simultaneously solves location-allocation and vehicle routing issues. It is critical to delivering emergency goods to customers with high reliability. In this paper, reliability in location and routing problems was considered as the probability of failure in depots, vehicles, and routs. The problem has two objectives, minimizing the cost and maximizing the reliability, the latter expressed by minimizing the expected cost of failure. First, a mathematical model of the problem was presented and due to its NP-hard nature, it was solved by a meta-heuristic approach using a NSGA-II algorithm and a discrete multi-objective firefly algorithm. The efficiency of these algorithms was studied through a complete set of examples and it was found that the multi-objective discrete firefly algorithm has a better Diversification Metric (DM) index; the Mean Ideal Distance (MID) and Spacing Metric (SM) indexes are only suitable for small to medium problems, losing their effectiveness for big problems.

A pareto optimal study for the multi-objective oil platform location problem with NSGA-II

2018 ◽  
Vol 169 ◽  
pp. 258-268 ◽  
Author(s):  
Marcus Vinicius Oliveira Camara ◽  
Glaydston Mattos Ribeiro ◽  
Marielce de Cássia Ribeiro Tosta
Keyword(s):  
Location Problem ◽  
Pareto Optimal ◽  
Nsga Ii ◽  
Multi Objective ◽  
Platform Location

Reference Point Based Multi-Objective Optimization to Workflow Grid Scheduling

2012 ◽  
Vol 3 (1) ◽  
pp. 80-99 ◽  
Author(s):  
Ritu Garg ◽  
Awadhesh Kumar Singh
Keyword(s):  
Reference Point ◽  
Simulation Analysis ◽  
Computation Time ◽  
Grid Scheduling ◽  
Nsga Ii ◽  
Multi Objective ◽  
Global Computing ◽  
Conflicting Objectives ◽  
Multiple Regions ◽  
Np Hard Problem

Grid provides global computing infrastructure for users to avail the services supported by the network. The task scheduling decision is a major concern in heterogeneous grid computing environment. The scheduling being an NP-hard problem, meta-heuristic approaches are preferred option. In order to optimize the performance of workflow execution two conflicting objectives, namely makespan (execution time) and total cost, have been considered here. In this paper, reference point based multi-objective evolutionary algorithms, R-NSGA-II and R-e-MOEA, are used to solve the workflow grid scheduling problem. The algorithms provide the preferred set of solutions simultaneously, near the multiple regions of interest that are specified by the user. To improve the diversity of solutions we used the modified form of R-NSGA-II (represented as M-R-NSGA-II). From the simulation analysis it is observed that, compared to other algorithms, R-e-MOEA delivers better convergence, uniform spacing among solutions keeping the computation time limited.

A Non-Dominant Sorting Genetic Algorithm for Optimization of a Product Design and Selection of Its Suppliers

2020 ◽  
Vol 19 (01) ◽  
pp. 167-188
Author(s):  
Oulfa Labbi ◽  
Abdeslam Ahmadi ◽  
Latifa Ouzizi ◽  
Mohammed Douimi
Keyword(s):  
Genetic Algorithm ◽  
Product Design ◽  
Computational Time ◽  
Optimization Approach ◽  
Nsga Ii ◽  
Solution Quality ◽  
Holding Costs ◽  
Weighted Sum Method ◽  
The Impact ◽  
Selection Of

The aim of this paper is to address the problem of supplier selection in a context of an integrated product design. Indeed, the product specificities and the suppliers’ constraints are both integrated into product design phase. We consider the case of improving the design of an existing product and study the selection of its suppliers adopting a bi-objective optimization approach. Considering multi-products, multi-suppliers and multi-periods, the mathematical model proposed aims to minimize supplying, transport and holding costs of product components as well as quality rejected items. To solve the bi-objective problem, an evolutionary algorithm namely, non-dominant sorting genetic algorithm (NSGA-II) is employed. The algorithm provides a set of Pareto front solutions optimizing the two objective functions at once. Since parameters values of genetic algorithms have a significant impact on their efficiency, we have proposed to study the impact of each parameter on the fitness functions in order to determine the optimal combination of these parameters. Thus, a number of simulations evaluating the effects of crossover rate, mutation rate and number of generations on Pareto fronts are presented. To evaluate performance of the algorithm, results are compared to those obtained by the weighted sum method through a numerical experiment. According to the computational results, the non-dominant sorting genetic algorithm outperforms the CPLEX MIP solver in both solution quality and computational time.

scholarly journals A Swarm Intelligence Graph-Based Pathfinding Algorithm Based on Fuzzy Logic (SIGPAF): A Case Study on Unmanned Surface Vehicle Multi-Objective Path Planning

2021 ◽  
Vol 9 (11) ◽  
pp. 1243
Author(s):  
Charis Ntakolia ◽  
Dimitrios V. Lyridis
Keyword(s):  
Fuzzy Logic ◽  
Path Planning ◽  
Swarm Intelligence ◽  
Optimal Path ◽  
Computation Time ◽  
Computational Effort ◽  
Unmanned Vehicles ◽  
Maritime Transportation ◽  
Solution Quality ◽  
Multi Objective

Advances in robotic motion and computer vision have contributed to the increased use of automated and unmanned vehicles in complex and dynamic environments for various applications. Unmanned surface vehicles (USVs) have attracted a lot of attention from scientists to consolidate the wide use of USVs in maritime transportation. However, most of the traditional path planning approaches include single-objective approaches that mainly find the shortest path. Dynamic and complex environments impose the need for multi-objective path planning where an optimal path should be found to satisfy contradicting objective terms. To this end, a swarm intelligence graph-based pathfinding algorithm (SIGPA) has been proposed in the recent literature. This study aims to enhance the performance of SIGPA algorithm by integrating fuzzy logic in order to cope with the multiple objectives and generate quality solutions. A comparative evaluation is conducted among SIGPA and the two most popular fuzzy inference systems, Mamdani (SIGPAF-M) and Takagi–Sugeno–Kang (SIGPAF-TSK). The results showed that depending on the needs of the application, each methodology can contribute respectively. SIGPA remains a reliable approach for real-time applications due to low computational effort; SIGPAF-M generates better paths; and SIGPAF-TSK reaches a better trade-off among solution quality and computation time.

scholarly journals A Novel Multi-Objective Artificial Bee Colony Algorithm for the QoS Based Wireless Route Optimization Problem

2012 ◽  
Vol 6-7 ◽  
pp. 445-451
Author(s):  
Chang Sheng Zhang ◽  
Ming Kang Ren ◽  
Bin Zhang
Keyword(s):  
Optimization Algorithm ◽  
Optimization Problem ◽  
Artificial Bee Colony ◽  
Route Optimization ◽  
Test Problems ◽  
Nsga Ii ◽  
Solution Quality ◽  
Artificial Bee Colony Optimization ◽  
Multi Objective ◽  
Bee Colony

In this paper, an efficient multi-objective artificial bee colony optimization algorithm based on Pareto dominance called PC_MOABC is proposed to tackle the QoS based route optimization problem. The concepts of Pareto strength and crowding distance are introduced into this algorithm, and are combined together effectively to improve the algorithm’s efficiency and generate a set of evenly distributed solutions. The proposed algorithm was evaluated on a set of different scale test problems and compared with the recently proposed popular NSGA-II based multi-objective optimization algorithm. The experimental results reveal very encouraging results in terms of the solution quality and the processing time required.

Distribution Center Multi-Objective Location Problem Using NSGA-II

2014 ◽  
Vol 998-999 ◽  
pp. 1133-1137
Author(s):  
Shuai Liu ◽  
Ben He Gao ◽  
Er Chao Liu ◽  
Yu Kun Liu
Keyword(s):  
Market Share ◽  
Location Problem ◽  
Distribution Center ◽  
Solution Set ◽  
Decision Makers ◽  
Set Covering ◽  
Ideal Solution ◽  
Nsga Ii ◽  
Multi Objective ◽  
Cost Constraints

Considering two goals of market share and location cost, this article builds a bi-objective location model. NSGA-II is utilized to acquire a Pareto non-dominated solution set. According to actual conditions such as cost constraints, decision-makers can choose solutions from non-dominated solution set. Furthermore, an approach based on Technique for Ordering Preferences by Similarity to Ideal Solution (TOPSIS) and minimum system’s cost under set covering are used to find out two reasonable solutions from the non-dominated solution set for decision-makers.

scholarly journals A Novel Framework for Applying Multiobjective GA and PSO Based Approaches for Simultaneous Area, Delay, and Power Optimization in High Level Synthesis of Datapaths

VLSI Design ◽  
2012 ◽  
Vol 2012 ◽  
pp. 1-12 ◽  
Author(s):  
D. S. Harish Ram ◽  
M. C. Bhuvaneswari ◽  
Shanthi S. Prabhu
Keyword(s):  
High Level Synthesis ◽  
Synthesis Process ◽  
Weighted Sum ◽  
Early Assessment ◽  
Nsga Ii ◽  
Multi Objective ◽  
Trade Offs ◽  
Evolutionary Technique ◽  
High Level ◽  
The Impact

High-Level Synthesis deals with the translation of algorithmic descriptions into an RTL implementation. It is highly multi-objective in nature, necessitating trade-offs between mutually conflicting objectives such as area, power and delay. Thus design space exploration is integral to the High Level Synthesis process for early assessment of the impact of these trade-offs. We propose a methodology for multi-objective optimization of Area, Power and Delay during High Level Synthesis of data paths from Data Flow Graphs (DFGs). The technique performs scheduling and allocation of functional units and registers concurrently. A novel metric based technique is incorporated into the algorithm to estimate the likelihood of a schedule to yield low-power solutions. A true multi-objective evolutionary technique, “Nondominated Sorting Genetic Algorithm II” (NSGA II) is used in this work. Results on standard DFG benchmarks indicate that the NSGA II based approach is much faster than a weighted sum GA approach. It also yields superior solutions in terms of diversity and closeness to the true Pareto front. In addition a framework for applying another evolutionary technique: Weighted Sum Particle Swarm Optimization (WSPSO) is also reported. It is observed that compared to WSGA, WSPSO shows considerable improvement in execution time with comparable solution quality.

Using NSGA-II to solve multi-objective competitive location problem with cooperative coverage for distance-based attractiveness

2021 ◽  
pp. 1-12
Author(s):  
Sheng-Chuan Wang ◽  
Ta-Cheng Chen
Keyword(s):  
Genetic Algorithms ◽  
Optimization Model ◽  
Location Problem ◽  
Solution Procedure ◽  
Competitive Location ◽  
Multi Objective Optimization ◽  
Demand Point ◽  
Nsga Ii ◽  
Solution Sets ◽  
Multi Objective

Multi-objective competitive location problem with cooperative coverage for distance-based attractiveness is introduced in this paper. The potential facilities compete to be selected to serve all demand points which are determined by maximizing total collective attractiveness of all demand points from assigned facilities and minimizing the fixed and distance costs between all demand points and selected facilities. Facility attractiveness is represented as a coverage of the facility with full, partial and none coverage corresponding to maximum full and partial coverage radii. Cooperative coverage, which the demand point is covered by at least one facility, is also considered. The problem is formulated as a multi-objective optimization model and solution procedure based on elitist non-dominated sorting genetic algorithms (NSGA-II) is developed. Experimental example demonstrates the best non-dominated solution sets obtained by developed solution procedure. Contributions of this paper include introducing competitive location problem with facility attractiveness as a distance-based coverage of the facility, re-categorizing facility coverage classification and developing solution procedure base upon NSGA-II.

Sign in / Sign up

Export Citation Format

Share Document