Computation of Inverse 1-Center Location Problem on the Weighted Trapezoid Graphs

2019 ◽  
Vol 31 (1) ◽  
pp. 14-35
Author(s):  
Biswanath Jana ◽  
Sukumar Mondal ◽  
Madhumangal Pal
Mathematics ◽  
2021 ◽  
Vol 9 (8) ◽  
pp. 853
Author(s):  
Jesús Sánchez-Oro ◽  
Ana D. López-Sánchez ◽  
Anna Martínez-Gavara ◽  
Alfredo G. Hernández-Díaz ◽  
Abraham Duarte

This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.


2019 ◽  
Vol 2019 ◽  
pp. 1-16 ◽  
Author(s):  
Rui Chi ◽  
Yixin Su ◽  
Zhijian Qu ◽  
Xuexin Chi

The location selection of logistics distribution centers is a crucial issue in the modern urban logistics system. In order to achieve a more reasonable solution, an effective optimization algorithm is indispensable. In this paper, a new hybrid optimization algorithm named cuckoo search-differential evolution (CSDE) is proposed for logistics distribution center location problem. Differential evolution (DE) is incorporated into cuckoo search (CS) to improve the local searching ability of the algorithm. The CSDE evolves with a coevolutionary mechanism, which combines the Lévy flight of CS with the mutation operation of DE to generate solutions. In addition, the mutation operation of DE is modified dynamically. The mutation operation of DE varies under different searching stages. The proposed CSDE algorithm is tested on 10 benchmarking functions and applied in solving a logistics distribution center location problem. The performance of the CSDE is compared with several metaheuristic algorithms via the best solution, mean solution, and convergence speed. Experimental results show that CSDE performs better than or equal to CS, ICS, and some other metaheuristic algorithms, which reveals that the proposed CSDE is an effective and competitive algorithm for solving the logistics distribution center location problem.


Sign in / Sign up

Export Citation Format

Share Document