Time-dependent Vehicle Routing Problem with Departure Time and Speed Optimization for Shared Autonomous Electric Vehicle Service

被引:21
作者
Ma, Bingshan [1 ]
Hu, Dawei [2 ]
Wang, Yin [2 ]
Sun, Qian [2 ]
He, Linwei [2 ]
Chen, Xiqiong [2 ]
机构
[1] Changan Univ, Sch Automobile, Xian 710064, Peoples R China
[2] Changan Univ, Sch Transportat Engn, Xian 710064, Peoples R China
关键词
Shared vehicles; electric vehicles; autonomous vehicles; time -dependent vehicle routing; departure time and speed optimization; adaptive large neighborhood search; A-RIDE PROBLEM; ENERGY-CONSUMPTION; RECHARGING STATIONS; DELIVERY PROBLEM; WINDOWS; ALGORITHM; PICKUP; SOLVE; MODEL;
D O I
10.1016/j.apm.2022.09.020
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
Shared autonomous electric vehicles (SAEVs) are expected to become a popular choice for urban transportation in the future. A solution to a vehicle routing problem that considers congestion and energy consumption of SAEVs is proposed to assist green transportation under poor traffic conditions. In addition to routing the fleet of SAEVs to serve customers, the proposed method also determines the vehicle speed in each arc and the departure time at each node by minimizing the cost considering the travel distance, energy con-sumption, and travel time. In the time-dependent vehicle routing problem with departure time and speed optimization for SAEV service (SAEV-TD-VRP-DSO), the electric vehicles (EVs) exchange batteries at battery swapping stations (BSSs), and the corresponding ve-hicle routing method also includes recharge scheduling. We develop a mixed-integer lin-ear model (MILP) to formulate the SAEV-TD-VRP-DSO and show that the state-of-the-art commercial optimization solver (CPLEX) can only solve a few instances (no more than 8 requests). Thus, an adaptive large neighborhood search (ALNS) algorithm is proposed to find near-optimal solutions for larger-size instances. The removal and insertion operators of ALNS help optimize the node sequences. A departure time and speed optimization pro-cedure (DSOP) is employed to optimize the speed and departure time in each arc. The good performance of the proposed algorithm is demonstrated using instance sets. The op-timization results of a case study in the Yanta Administrative District in Xi'an, China, show that speed and departure time optimization result in 24.99% cost savings. The sensitivity analysis results provide the SAEV operators with alternative cost-saving solutions. Empty vehicles traveling at a slower speed can reduce energy cost. The total cost of operating ve-hicles with passengers can be reduced by avoiding congestion and utilizing larger capacity batteries (32 kWh or more) and a lower minimum battery level (0.2-0.3). (c) 2022 Elsevier Inc. All rights reserved.
引用
收藏
页码:333 / 357
页数:25
相关论文
共 73 条
  • [1] The Pollution-Routing Problem
    Bektas, Tolga
    Laporte, Gilbert
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2011, 45 (08) : 1232 - 1250
  • [2] Logistical Planning for Electric Vehicles Under Time-Dependent Stochastic Traffic
    Bi, Xiaowen
    Tang, Wallace K. S.
    [J]. IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2019, 20 (10) : 3771 - 3781
  • [3] The electric autonomous dial-a-ride problem
    Bongiovanni, Claudia
    Kaspi, Mor
    Geroliminis, Nikolas
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2019, 122 : 436 - 456
  • [4] An optimization framework for the development of efficient one-way car-sharing systems
    Boyaci, Burak
    Zografos, Konstantinos G.
    Geroliminis, Nikolas
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2015, 240 (03) : 718 - 733
  • [5] Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
    Braekers, Kris
    Caris, An
    Janssens, Gerrit K.
    [J]. TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2014, 67 : 166 - 186
  • [6] Bruglieri Maurizio., 2016, ELECT NOTES DISCRETE, V55, P89, DOI DOI 10.1016/J.ENDM.2016.10.023
  • [7] An adaptive large neighborhood search heuristic for the vehicle routing problem with time windows and delivery robots
    Chen, Cheng
    Demir, Emrah
    Huang, Yuan
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2021, 294 (03) : 1164 - 1180
  • [8] Chen JB, 2016, 2016 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM), P712, DOI 10.1109/IEEM.2016.7797968
  • [9] The dial-a-ride problem: models and algorithms
    Cordeau, Jean-Francois
    Laporte, Gilbert
    [J]. ANNALS OF OPERATIONS RESEARCH, 2007, 153 (01) : 29 - 46
  • [10] A branch-and-cut algorithm for the dial-a-ride problem
    Cordeau, Jean-Francois
    [J]. OPERATIONS RESEARCH, 2006, 54 (03) : 573 - 586