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 条
  • [1] SEVGI E, EL1SE M., A green vehicle routing problem, Transportation Research Part E: Logistics &- Transportation Review, 48, 1, pp. 100-114, (2012)
  • [2] FELIPEO A, ORTU NOMT, RIGHINI G, Et al., A heuristic-approach for the green vehicle routing prohlem with multiple technologies and partial recharges [J], Transportation Research Part E: Logistics and Transportation Review, 71, pp. 111-128, (2014)
  • [3] MAURIZK B, FERD1NANDO P, ORNELLA P, Et al., A variable neighborhood search branching for the electric vehicle routing problem with time windows [J], Electronic Notes in Discrete Mathematics, 47, pp. 221-228, (2015)
  • [4] TANG Chunyan, YANG Kaiqlang, WU Na, Optimizing flexible vehicle scheduling for single-line battery electric buses, Journal of Transportation Systems Engineering and Information Technology, 20, 3, pp. 156-162, (2020)
  • [5] HE Meilin, WEI Zhiwiu, WU Xiaohui, Et al., Improved ant colony optimization algorithm for solving vehicle routing problem with soft time windows[j], Computer Integrated Manufacturing Systems, 29, 3, pp. 1029-1039, (2023)
  • [6] HAN Yajuan, PENG Yunfang, WEI Hang, Et al., Hyper-heuristic genetic algorithm for vehicle routing prohlem with soft time windows [J], Computer Integrated Manufacturing Systems, 25, 10, pp. 2571-2579, (2019)
  • [7] TANG X D, LIN X, HE F., Robust scheduling strategies of e-lectric buses under stochastic traffic conditions, Transportation Research Part C: Emerging Technologies, 105, pp. 163-182, (2019)
  • [8] DOU Xuepmg, GUO Xiucheng, GONG Xlaolin, Robust timetable optimization model for coordinated scheduling in a bus network[j], Journal of Southwest University: Natural Science, 46, 5, pp. 1110-1114, (2016)
  • [9] SHEN Y D, XU J, LI J P., A probabilistic model for vehicle scheduling based on stochastic trip times[j], Transportation Research Part B:Methodological, 85, pp. 19-31, (2016)
  • [10] JIANG J, NG K M, POH K L, Et al., Vehicle routing problem with a heterogeneous fleet and time windows[j], Expert Systems with Applications, 41, 8, pp. 3748-3760, (2014)
12