The Shortest Path Problems in Battery-Electric Vehicle Dispatching with Battery Renewal

Electric vehicles play a key role for developing an eco-sustainable transport system. One critical component of an electric vehicle is its battery, which can be quickly charged or exchanged before it runs out. The problem of electric vehicle dispatching falls into the category of the shortest path problem with resource renewal. In this paper, we study the shortest path problems in (1) electric transit bus scheduling and (2) electric truck routing with time windows. In these applications, a fully-charged battery allows running a limited operational distance, and the battery before depletion needs to be quickly charged or exchanged with a fully-charged one at a battery management facility. The limited distance and battery renewal result in a shortest path problem with resource renewal. We develop a label-correcting algorithm with state space relaxation to find optimal solutions. In the computational experiments, real-world road geometry data are used to generate realistic travel distances, and other types of data are obtained from the real world or randomly generated. The computational results show that the label-correcting algorithm performs very well.

[1]  Roberto Roberti,et al.  The Electric Traveling Salesman Problem with Time Windows , 2016 .

[2]  Natashia Boland,et al.  Improved preprocessing, labeling and scaling algorithms for the Weight‐Constrained Shortest Path Problem , 2003, Networks.

[3]  Gabriel Y. Handler,et al.  A dual algorithm for the constrained shortest path problem , 1980, Networks.

[4]  Klaudia Frankfurter.  Computers And Intractability A Guide To The Theory Of Np Completeness , 2016 .

[5]  Giovanni Righini,et al.  Symmetry helps: Bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints , 2006, Discret. Optim..

[6]  W.A. O'Brien.  Electric vehicles (EVs): 'a look behind the scenes' , 1993, IEEE Aerospace and Electronic Systems Magazine.

[7]  Seyed Jafar Sadjadi,et al.  Robust Train Timetabling Problem: Mathematical Model and Branch and Bound Algorithm , 2012, IEEE Transactions on Intelligent Transportation Systems.

[8]  Mehmet Uzunoglu,et al.  A double-layer smart charging strategy of electric vehicles taking routing and charge scheduling into account , 2016 .

[9]  Guy Desaulniers,et al.  Multi-depot vehicle scheduling problems with time windows and waiting costs , 1996, Eur. J. Oper. Res..

[10]  Liang He,et al.  Design of a Mobile Charging Service for Electric Vehicles in an Urban Environment , 2015, IEEE Transactions on Intelligent Transportation Systems.

[11]  Martin Desrochers,et al.  A Column Generation Approach to the Urban Transit Crew Scheduling Problem , 1987, Transp. Sci..

[12]  Xuesong Zhou,et al.  Reformulation and Solution Algorithms for Absolute and Percentile Robust Shortest Path Problems , 2013, IEEE Transactions on Intelligent Transportation Systems.

[13]  Ferdinando Pezzella,et al.  A Variable Neighborhood Search Branching for the Electric Vehicle Routing Problem with Time Windows , 2015, Electron. Notes Discret. Math..

[14]  K. Shadan,et al.  Available online: , 2012 .

[15]  Kerem Bülbül,et al.  Solving a robust airline crew pairing problem with column generation , 2013, Comput. Oper. Res..

[16]  J. Current,et al.  An Improved Solution Algorithm for the Constrained Shortest Path Problem , 2007 .

[17]  Stefan Irnich,et al.  The Shortest-Path Problem with Resource Constraints and k-Cycle Elimination for k 3 , 2006, INFORMS J. Comput..

[18]  Michel Gendreau,et al.  An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems , 2004, Networks.

[19]  Marius M. Solomon,et al.  Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints , 1987, Oper. Res..

[20]  Ying-Wei Wang,et al.  Locating Road-Vehicle Refueling Stations , 2009 .

[21]  Nicos Christofides,et al.  An algorithm for the resource constrained shortest path problem , 1989, Networks.

[22]  Stefan Irnich,et al.  The shortest-path problem with resource constraints with (k, 2)-loop elimination and its application to the capacitated arc-routing problem , 2014, Eur. J. Oper. Res..

[23]  Barış Yıldız,et al.  A branch and price approach for routing and refueling station location model , 2016, Eur. J. Oper. Res..

[24]  MengChu Zhou,et al.  Centralized Charging Strategy and Scheduling Algorithm for Electric Vehicles Under a Battery Swapping Scenario , 2016, IEEE Transactions on Intelligent Transportation Systems.

[25]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[26]  Paolo Toth,et al.  State-space relaxation procedures for the computation of bounds to routing problems , 1981, Networks.

[27]  Jing-Quan Li.  Match bus stops to a digital road network by the shortest path model , 2012 .

[28]  Natashia Boland,et al.  Accelerated label setting algorithms for the elementary resource constrained shortest path problem , 2006, Oper. Res. Lett..

[29]  Jing-Quan Li,et al.  Transit Bus Scheduling with Limited Energy , 2014, Transp. Sci..

[30]  M. Desrochers,et al.  A Generalized Permanent Labelling Algorithm For The Shortest Path Problem With Time Windows , 1988 .

[31]  Giovanni Righini,et al.  New dynamic programming algorithms for the resource constrained elementary shortest path problem , 2008, Networks.

[32]  Martin Desrochers,et al.  A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows , 1990, Oper. Res..