Journal of Computer Applications ›› 2022, Vol. 42 ›› Issue (9): 2926-2935.DOI: 10.11772/j.issn.1001-9081.2021071361

• Frontier and comprehensive applications • Previous Articles    

Hybrid adaptive large neighborhood search algorithm for solving time-dependent vehicle routing problem in cold chain logistics

Zhihao XIAO, Zhihua HU(), Lin ZHU   

  1. Logistics Research Center,Shanghai Maritime University,Shanghai 201306,China
  • Received:2021-07-30 Revised:2021-10-13 Accepted:2021-10-14 Online:2021-10-25 Published:2022-09-10
  • Contact: Zhihua HU
  • About author:XIAO Zhihao, born in 1997, M. S. candidate. His research interests include optimization of logistics system.
    ZHU Lin, born in 1986, Ph. D., lecturer. Her research interests include vehicle routing optimization.
  • Supported by:
    National Natural Science Foundation of China(71871136)


肖智豪, 胡志华(), 朱琳   

  1. 上海海事大学 物流研究中心,上海 201306
  • 通讯作者: 胡志华
  • 作者简介:肖智豪(1997—),男,四川成都人,硕士研究生,主要研究方向:物流系统优化;
  • 基金资助:


Aiming at the problems of premature convergence and easily falling into local optimum in the adaptive large neighborhood search algorithms with single mechanism, a hybrid adaptive large neighborhood search algorithm was proposed to solve Time-Dependent Vehicle Routing Problem (TDVRP) in cold chain logistics. Firstly, the time-varying vehicle speed was described according to the continuous driving time dependent function, the real-time fuel consumption was evaluated by using the comprehensive fuel consumption model, and a routing optimization model with the goal of minimizing the total cost was established. Then, according to the NP (Non-deterministic Polynomial)-hard property and time-dependent characteristics of the problem, a variety of large neighborhood search operators for destroying and repairing solutions were designed, and the destroy-repair large neighborhood search operators were integrated into Artificial Bee Colony (ABC) algorithm to improve the global search ability of the algorithm. Simulation results show that compared with Adaptive Variable Neighborhood Search Elite Ant Colony (AVNS_EAC) algorithm, Adaptive Large Neighborhood Search Elite Ant Colony (ALNS_EAC) algorithm, Adaptive Large Neighborhood Search Elite Genetic (ALNS_EG) algorithm and Adaptive Large Neighborhood Search Simulated Annealing (ALNS_SA) algorithm, the proposed Adaptive Large Neighborhood Search Artificial Bee Colony (ALNS_ABC) algorithm has the optimal fitness values increased by 46.3%, 5.3%, 36.8% and 6% respectively and averagely on multiple test data groups. It can be seen that this algorithm has higher computational performance and stronger stability, and can provide a more reasonable decision-making basis for cold chain logistics enterprises to take into account economic and environmental benefits at the same time.

Key words: cold chain logistics, Vehicle Routing Problem (VRP), time-dependent, hybrid metaheuristic algorithm, adaptive large neighborhood search, Artificial Bee Colony (ABC) algorithm



关键词: 冷链物流, 车辆路径问题, 时间依赖型, 混合元启发式算法, 自适应大邻域搜索, 人工蜂群算法

CLC Number: