Journal of System Simulation
Abstract
Abstract: Based on the characteristics of two-echelon, multi-center, and heterogeneous fleets in urban logistics joint distribution system, the two-echelon joint distribution location routing problem is studied. The problem is formulated into a mixed integer programming model to minimize the total costs. An adaptive large neighborhood search algorithm (ALNS) for solving the model with multiple deletion and insertion operators is proposed to obtain neighborhood solution. The selection probability of each operator is adjusted according to the neighborhood solution to accelerate the convergence speed. Several test examples are generated based on the benchmark of location-routing problem. Both ALNS algorithm and Gurobi software are used to solve the problem respectively, and the fast effectiveness of the ALNS algorithm is verified by comparative analysis.
Recommended Citation
Li, Zhenping; Zhao, Yuwei; Zhang, Yuwei; Xing, Lining; and Teng, Ren
(2021)
"Joint Distribution Location-routing Problem and Large Neighborhood Search Algorithm,"
Journal of System Simulation: Vol. 33:
Iss.
10, Article 25.
DOI: 10.16182/j.issn1004731x.joss.20-0685
Available at:
https://dc-china-simulation.researchcommons.org/journal/vol33/iss10/25
First Page
2518
Revised Date
2020-11-22
DOI Link
https://doi.org/10.16182/j.issn1004731x.joss.20-0685
Last Page
2531
CLC
TP391.9
Recommended Citation
Li Zhenping, Zhao Yuwei, Zhang Yuwei, Xing Lining, Ren Teng. Joint Distribution Location-routing Problem and Large Neighborhood Search Algorithm[J]. Journal of System Simulation, 2021, 33(10): 2518-2531.
DOI
10.16182/j.issn1004731x.joss.20-0685
Included in
Artificial Intelligence and Robotics Commons, Computer Engineering Commons, Numerical Analysis and Scientific Computing Commons, Operations Research, Systems Engineering and Industrial Engineering Commons, Systems Science Commons