Whole Day Mobility Planning with Electric Vehicles

We propose a novel and challenging variant of trip planning problems – Whole Day Mobility Planning with Electric Vehicles (WDMEV). WDMEV combines several concerns, which has been so far only considered separately, in order to realistically model the problem of planning mobility with electric vehicles (EVs). A key difference between trip planning for combustion engine cars and trip planning for EVs is the comparatively lower battery capacity and comparatively long charging times of EVs – which makes it important to carefully consider charging when planning travel. The key idea behind WDMEV is that the user can better optimize his/her mobility with EVs, if it considers the activities he/she needs to perform and the travel required to get to the locations of these activities for the whole day rather than planning for single trips only. In this paper, we formalize the WDMEV problem and propose a solution based on a label-setting heuristic search algorithm, including several speed-ups. We evaluate the proposed algorithm on a realistic set of benchmark problems, confirming that the whole day approach reduces the time required to complete one’s day travel with EVs and that it also makes it cheaper, compared to the traditional single-trip approach.

[1]  Charalampos Konstantopoulos,et al.  Time-Dependent Bi-Objective Itinerary Planning Algorithm: Application in Sea Transportation , 2016, ATMOS.

[2]  Frederico G. Guimarães,et al.  A comparison of dominance criteria in many-objective optimization problems , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[3]  Jacques Desrosiers,et al.  An Optimal Algorithm for the Traveling Salesman Problem with Time Windows , 1991, Oper. Res..

[4]  Stefan Funke,et al.  Optimal Route Planning for Electric Vehicles in Large Networks , 2011, AAAI.

[5]  Stefan Irnich,et al.  Exact Algorithms for Electric Vehicle-Routing Problems with Time Windows , 2014, Oper. Res..

[6]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[7]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[8]  Samir Khuller,et al.  To fill or not to fill: The gas station problem , 2007, TALG.

[9]  Sylvie Gélinas,et al.  A dynamic programming algorithm for the shortest path problem with time windows and linear node costs , 1994, Networks.

[10]  Hui Xiong,et al.  Multi-type nearest neighbor queries in road networks with time window constraints , 2009, GIS.

[11]  Martin Leucker,et al.  Efficient Energy-Optimal Routing for Electric Vehicles , 2011, AAAI.

[12]  G. Nemhauser A generalized permanent label setting algorithm for the shortest path between specified nodes , 1972 .

[13]  Nils J. Nilsson,et al.  A Formal Basis for the Heuristic Determination of Minimum Cost Paths , 1968, IEEE Trans. Syst. Sci. Cybern..

[14]  Jacques Desrosiers,et al.  Time Constrained Routing and Scheduling , 1992 .

[15]  Pierre Hansen,et al.  Bicriterion Path Problems , 1980 .

[16]  Mark W. Krentel The Complexity of Optimization Problems , 1986, Computational Complexity Conference.

[17]  Vassilis J. Tsotras,et al.  Parameterized algorithms for generalized traveling salesman problems in road networks , 2013, SIGSPATIAL/GIS.

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

[19]  Ying Zhang,et al.  Integrated Route and Charging Planning for Electric Vehicles Considering Nonlinear Charging Functions , 2018, 2018 IEEE 22nd International Conference on Computer Supported Cooperative Work in Design ((CSCWD)).

[20]  Dominik Goeke,et al.  The Electric Vehicle-Routing Problem with Time Windows and Recharging Stations , 2014, Transp. Sci..

[21]  Feifei Li,et al.  On Trip Planning Queries in Spatial Databases , 2005, SSTD.

[22]  Giovanni Righini,et al.  A heuristic approach for the green vehicle routing problem with multiple technologies and partial recharges , 2014 .

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

[24]  Martin Leucker,et al.  The Shortest Path Problem Revisited: Optimal Routing for Electric Vehicles , 2010, KI.

[25]  Oya Ekin Karasan,et al.  Minimum cost path problem for Plug-in Hybrid Electric Vehicles , 2015 .