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

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.

Symmetry ◽  
2021 ◽  
Vol 13 (1) ◽  
pp. 136
Author(s):  
Wenxiao Li ◽  
Yushui Geng ◽  
Jing Zhao ◽  
Kang Zhang ◽  
Jianxin Liu

This paper explores the combination of a classic mathematical function named “hyperbolic tangent” with a metaheuristic algorithm, and proposes a novel hybrid genetic algorithm called NSGA-II-BnF for multi-objective decision making. Recently, many metaheuristic evolutionary algorithms have been proposed for tackling multi-objective optimization problems (MOPs). These algorithms demonstrate excellent capabilities and offer available solutions to decision makers. However, their convergence performance may be challenged by some MOPs with elaborate Pareto fronts such as CFs, WFGs, and UFs, primarily due to the neglect of diversity. We solve this problem by proposing an algorithm with elite exploitation strategy, which contains two parts: first, we design a biased elite allocation strategy, which allocates computation resources appropriately to elites of the population by crowding distance-based roulette. Second, we propose a self-guided fast individual exploitation approach, which guides elites to generate neighbors by a symmetry exploitation operator, which is based on mathematical hyperbolic tangent function. Furthermore, we designed a mechanism to emphasize the algorithm’s applicability, which allows decision makers to adjust the exploitation intensity with their preferences. We compare our proposed NSGA-II-BnF with four other improved versions of NSGA-II (NSGA-IIconflict, rNSGA-II, RPDNSGA-II, and NSGA-II-SDR) and four competitive and widely-used algorithms (MOEA/D-DE, dMOPSO, SPEA-II, and SMPSO) on 36 test problems (DTLZ1–DTLZ7, WGF1–WFG9, UF1–UF10, and CF1–CF10), and measured using two widely used indicators—inverted generational distance (IGD) and hypervolume (HV). Experiment results demonstrate that NSGA-II-BnF exhibits superior performance to most of the algorithms on all test problems.


2018 ◽  
Vol 169 ◽  
pp. 258-268 ◽  
Author(s):  
Marcus Vinicius Oliveira Camara ◽  
Glaydston Mattos Ribeiro ◽  
Marielce de Cássia Ribeiro Tosta

2019 ◽  
Vol 11 (3) ◽  
pp. 929 ◽  
Author(s):  
Yu Guo ◽  
Yanqing Ye ◽  
Qingqing Yang ◽  
Kewei Yang

Maritime search and rescue (SAR) operations play a crucial role in reducing fatalities and mitigating human suffering. Compared to short-range maritime SAR, long-range maritime SAR (LRMSAR) is more challenging due to the far distance from the shore, changeful weather, and less available resources. Such an operation put high requirements on decision makers to timely assign multiple resources, such as aircraft and vessels to deal with the emergency. However, most current researches pay attention to assign only one kind of resource, while practically, multiple resources are necessary for LRMSAR. Thus, a method is proposed to provide support for decision makers to allocate multiple resources in dealing with LRMSAR problem; to ensure the sustainable use of resources. First, by analyzing the factors involved in the whole process, we formulated the problem as a multi-objective optimization problem, the objective of which was to maximize both the probability of completing the tasks and the utilities of allocated resources. Based on the theory of search, an integer nonlinear programming (INLP) model was built for different tasks. Second, in order to solve the non-deterministic polynomial-time hardness (NP-hard) model, by constructing a rule base, candidate solutions can be found to improve the calculation efficiency. Furthermore, in order to obtain the optimal scheme, the Non-dominated Sorting Genetic Algorithm II (NSGA-II) was applied to the candidate solution sets to approximate Pareto fronts. Finally, an emergency case of Chinese Bohai Sea was used to demonstrate the effectiveness of the proposed model. In the study, 11 resource allocation schemes were obtained to respond to the emergency, and calculation processes of schemes were further analyzed to demonstrate our model’s rationality. Results showed that the proposed models provide decision-makers with scientific decision support on different emergency tasks.


2020 ◽  
Vol 7 (4) ◽  
pp. 469-488 ◽  
Author(s):  
Vahid Hajipour ◽  
Madjid Tavana ◽  
Francisco J Santos-Arteaga ◽  
Alireza Alinezhad ◽  
Debora Di Caprio

Abstract Supplier selection and order allocation constitute vital strategic decisions that must be made by managers within supply chain management environments. In this paper, we propose a multi-objective fuzzy model for supplier selection and order allocation in a two-level supply chain with multi-period, multi-source, and multi-product characteristics. The supplier evaluation objectives considered in this model include cost, delay, and electronic-waste (e-waste) minimization, as well as coverage and weight maximization. A signal function is used to model the price discount offered by the suppliers. Triangular fuzzy numbers are used to deal with the uncertainty of delay and e-waste parameters while the fuzzy Technique for Order Performance by Similarity to Ideal Solution (TOPSIS) is used to obtain the weights of the suppliers. The resulting NP-hard problem, a Pareto-based meta-heuristic algorithm called controlled elitism non-dominated sorting genetic algorithm (CENSGA), is developed. The Non-dominated Sorting Genetic Algorithm (NSGA-II) and Multi-Objective Particle Swarm Optimization (MOPSO) are used to validate the applicability of the CENSGA algorithm and the Taguchi technique to tune the parameters of the algorithms. The results are analysed using graphical and statistical comparisons illustrating how the proposed CENSGA dominates NSGA-II and MOPSO in terms of mean ideal solution distance (MID) and spacing metrics.


2017 ◽  
Vol 5 (1) ◽  
pp. 120-136 ◽  
Author(s):  
Ali Salmasnia ◽  
Saeed Hasannejad ◽  
Hadi Mokhtari

Abstract This paper addresses the optimization of monofilament tufting process as the most important and the main stage of toothbrush production in sanitary industries. In order to minimize both process time and depreciation costs, and ultimately increase the production efficiency in such an industrial unit, we propose a metaheuristic based optimization approach to solve it. The Traveling Salesman Problem (TSP) is used to formulate the proposed problem. Then by using multi-objective evolutionary algorithms, NSGA-II and MOPSO, we seek to obtain the best solution and objective functions described above. Extensive computational experiments on three different kinds of toothbrush handles are performed and the results demonstrate the applicability and appropriate performance of algorithms. The comparison metrics like spacing, number of Pareto solutions, time, mean distance from the ideal solution and diversity are used to evaluate the quality of solutions. Moreover a sensitivity analysis is done for investigation of the performance in various setting of parameters. Key points Brush monofilament tufting process design. NSGA-II and MOPSO as multi-objective approaches. Extensive computational experiments. Comparison metrics like spacing, number of Pareto solutions, time, mean distance from ideal solution and diversity.


2020 ◽  
Vol 12 (18) ◽  
pp. 7634
Author(s):  
Xifeng Tang ◽  
Jiantao Wu ◽  
Rui Li

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.


2021 ◽  
pp. 1-12
Author(s):  
Sheng-Chuan Wang ◽  
Ta-Cheng Chen

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.


Water ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 935 ◽  
Author(s):  
Ulrich A. Ngamalieu-Nengoue ◽  
F. Javier Martínez-Solano ◽  
Pedro L. Iglesias-Rey ◽  
Daniel Mora-Meliá

Drainage networks are civil constructions which do not generally attract the attention of decision-makers. However, they are of crucial importance for cities; this can be seen when a city faces floods resulting in extensive and expensive damage. The increase of rain intensity due to climate change may cause deficiencies in drainage networks built for certain defined flows which are incapable of coping with sudden increases, leading to floods. This problem can be solved using different strategies; one is the adaptation of the network through rehabilitation. A way to adapt the traditional network approach consists of substituting some pipes for others with greater diameters. More recently, the installation of storm tanks makes it possible to temporarily store excess water. Either of these solutions can be expensive, and an economic analysis must be done. Recent studies have related flooding with damage costs. In this work, a novel solution combining both approaches (pipes and tanks) is studied. A multi-objective optimization algorithm based on the NSGA-II is proposed for the rehabilitation of urban drainage networks through the substitution of pipes and the installation of storage tanks. Installation costs will be offset by damage costs associated with flooding. As a result, a set of optimal solutions that can be implemented based on the objectives to be achieved by municipalities or decisions makers. The methodology is finally applied to a real network located in the city of Bogotá, Colombia.


Sign in / Sign up

Export Citation Format

Share Document