A hybrid ACS-VTM algorithm for the vehicle routing problem with simultaneous delivery & pickup and real-time traffic information
A hybrid ACS-VTM algorithm for the vehicle routing problem with simultaneous delivery & pickup and real-time traffic information
复制标题
解决同时配送车辆路径问题的混合ACS-VTM算法
DOI：
10.1016/j.cie.2021.107747
复制
发表时间：
2021
期刊：
影响因子：
--
通讯作者：
Chen Jian
中科院分区：
文献类型：
--
作者：
Liu Wenjie;Zhou Yutong;Liu Wei;Qiu Jing;Xie Naiming;Chang Xiangyun;Chen Jian
Vehicle routing problem with simultaneous delivery & pickup and real-time traffic information (VRPSDPTI) is a dynamic problem of combinational network optimization in logistics and supply chain management. It is also a typical NP-hard problem and has been plaguing enterprises with reverse logistics operation for many years. Major objective of this research is to determine an optimal vehicle routing planning for the VRPSDPTI problem. To achieve this goal, a mixed integer linear programming (MILP) model was constructed, with an objective of minimizing total travel cycle of the VRPSDPTI problem. Then a hybrid algorithm of ant colony system and virtual transformation method (ACS-VTM) was designed to explore the optimal vehicle routing planning for this dynamic real-time problem. On the basis of it, an illustrative numerical case of the VRPSDPTI problem was adopted to verify the rationality and effectiveness of the proposed model and algorithm. Two useful business suggestions were put forward for the future operations: (1) Adopting the hybrid ACS-VMT algorithm can effectively shorten the total travel cycle of the VRPSDPTI problem about 12%; (2) Vehicle capability of executing re-optimized planning should be controlled at 10 times per hours to minimize the total travel cycle. This paper provides an efficient and practical decision tool to solve the VRPSDP with real-time traffic information, which can not only reduce the total travel cycle but also improve the efficiency of vehicle utilization.
