Journal of System Simulation ›› 2021, Vol. 33 ›› Issue (10): 2518-2531.doi: 10.16182/j.issn1004731x.joss.20-0685

Previous Articles    

Joint Distribution Location-routing Problem and Large Neighborhood Search Algorithm

Li Zhenping1, Zhao Yuwei1,2, Zhang Yuwei1,3, Xing Lining4, Ren Teng5,*   

  1. 1. School of Information, Beijing Wuzi University, Beijing 101149, China;
    2. School of Economics and Management, Beijing University of Chemical Technology, Beijing 100029,China;
    3. School of Management Engineering, Capital University of Economics and Business, Beijing 100070, China;
    4. School of Information System and Management, University of National Defense Science and Technology, Changsha 410003, China;
    5. School of Logistics and transportation, Central South University of Forestry and Technology, Changsha 410004, China
  • Received:2020-09-10 Revised:2020-11-22 Online:2021-10-18 Published:2021-10-18

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.

Key words: two-echelon joint distribution, location-routing problem, mixed integer programming, adaptive large neighborhood search, simulated annealing

CLC Number: