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 条
  • [21] A computationally efficient simulation model for estimating energy consumption of electric vehicles in the context of route planning applications
    Genikomsakis, Konstantinos N.
    Mitrentsis, Georgios
    [J]. TRANSPORTATION RESEARCH PART D-TRANSPORT AND ENVIRONMENT, 2017, 50 : 98 - 118
  • [22] An adaptive large neighborhood search heuristic for the Pickup and Delivery Problem with Time Windows and Scheduled Lines
    Ghilas, Veaceslav
    Demir, Emrah
    Van Woensel, Tom
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2016, 72 : 12 - 30
  • [23] Greenblatt J. B., 2015, Current Sustainable/Renewable Energy Reports, V2, P74, DOI [10.1007/s40518-015-0038-5, DOI 10.1007/S40518-015-0038-5]
  • [24] The Electric Fleet Size and Mix Vehicle Routing Problem with Time Windows and Recharging Stations
    Hiermann, Gerhard
    Puchinger, Jakob
    Ropke, Stefan
    Hartl, Richard F.
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2016, 252 (03) : 995 - 1018
  • [25] Ho SG, 2018, IEEE INT C INTELL TR, P778, DOI 10.1109/ITSC.2018.8569733
  • [26] Hu T-Y, 2011, J E ASIA SOC TRANSPO, V9, P690, DOI [10.11175/easts.9.690, DOI 10.11175/EASTS.9.690]
  • [27] A revised branch-and-price algorithm for dial-a-ride problems with the consideration of time-dependent travel cost
    Hu, Ta-Yin
    Chang, Chin-Ping
    [J]. JOURNAL OF ADVANCED TRANSPORTATION, 2015, 49 (06) : 700 - 723
  • [28] The two-echelon capacitated electric vehicle routing problem with battery swapping stations: Formulation and efficient methodology
    Jie, Wanchen
    Yang, Jun
    Zhang, Min
    Huang, Yongxi
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2019, 272 (03) : 879 - 904
  • [29] Variable neighborhood search-based solution methods for the pollution location-inventory-routing problem
    Karakostas, Panagiotis
    Sifaleras, Angelo
    Georgiadis, Michael C.
    [J]. OPTIMIZATION LETTERS, 2022, 16 (01) : 211 - 235
  • [30] Adaptive variable neighborhood search solution methods for the fleet size and mix pollution location-inventory-routing problem
    Karakostas, Panagiotis
    Sifaleras, Angelo
    Georgiadis, Michael C.
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2020, 153