Robust electric vehicle routing problem based on column generation algorithm

被引：0
|
作者：
Hu J. [1 ,2 ]
Luo X. [1 ,2 ]
Gan Y. [1 ]
机构：
[1] School of Transportation and Logistics, Southwest Jiaotong University, Chengdu
[2] National United Engineering Laboratory of Integrated and Intelligent Transportation, Southwest Jiaotong University, Chengdu
来源：
Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS | 2023年 / 29卷 / 07期
关键词：
column generation algorithm; electric vehicles; integer programming; road transportation; shortest path; travel time uncertainty;
D O I：
10.13196/j.cims.2023.07.024
中图分类号：
学科分类号：
摘要：
To study the electric vehicle routing problem with travel time uncertainty and soft time window constraints, a mixed integer programming model was established with the minimum distribution costs as the objective. The virtual node was introduced to construct the routing network model, and the column generation algorithm was used for solving. The model was converted to a linear master problem and the shortest path subproblem with limited resource constraints. Shortest path search method based on improved Bellman-Ford algorithm and dynamic path planning algorithm was designed, and a path expansion mechanism was introduced to improve the efficiency of model solution. Through the calculation of several groups of examples, the proposed algorithm could effectively improve the solving rate of the problem. In addition, the sensitivity analysis results showed that the maximum allowable delay time had the most significant effect on the distribution cost, followed by the load capacity of the electric vehicle. © 2023 CIMS. All rights reserved.
引用
收藏
页码：2427 / 2439
页数：12
相关论文
共 18 条
  • [11] SCHNEIDER M, AMGOEKE D., The electric vehicle- routing problem with time windows and recharging sta-tionsQ, Transportation Science, 48, 4, pp. 500-520, (2014)
  • [12] XIA Yangkun, DENG Yongdong, PANG Yan, Et al., Fresh food vehicle routing problem with split deliveries and customer classification [J], Computer Integrated Manufacturing Systems, 27, 4, pp. 1238-1248, (2021)
  • [13] JIE Wanchen, YANG Jun, YANG Chao, Branch-and-price algorithm for heterogenous electric vehicle routing problem [J], Systems Engineering Theory & Practice, 36, 7, pp. 1795-1805, (2016)
  • [14] ANDELMIN J, BARTOLINI E., An exact algorithm for the green vehicle routing prohlem, Transportation Science, 51, 4, pp. 1288-1303, (2017)
  • [15] YU Y, WANG S H, WANG J W, Et al., A branch-and-price algorithm for the heterogeneous fleet green vehicle routing prohlem with time windows [J], Transportation Research Part B: Methodological, 122, pp. 511-527, (2019)
  • [16] YANG Yang, GUAN Wei, MA Jihui, Battery electric transit bus schedule problems based on colum generation approach [J], Journal of Transportation Systems Engineering and Information Technology, 16, 5, pp. 198-204, (2016)
  • [17] FEILLET D, GENDREAU M, MEDAGLIA A L, Et al., A note on branch-and-cut-and-price [J ~J, Operations Research Letters, 38, 5, pp. 346-353, (2010)
  • [18] PU Song, LU Hongxia, CHEN Dingyun, Et al., High speed railway passenger train line planning optimization based on improved colum generation algorithm[J], Journal of the China Railway Society, 37, 9, pp. l-7, (2015)
12