A complementarity equilibrium model for electric vehicles with charging

Abstract This paper presents a complementarity equilibrium model for electric vehicles (EVs). Under the equilibrium conditions, each EV takes the path that is shortest and does not violate the driving range. When the driving range has to be violated, the EVs are allowed to choose a path with a charging station to extend their driving range. To find the shortest such path, a constrained shortest path problem with replenishment (CSPP with replenishment) is formulated that considers the driving range limit of EVs. The CSPP is solved with a label-correcting algorithm with two additional steps that substantially reduce the computation time and the required memory. The first procedure is a pruning technique that eliminates exploring branches (of an enumeration tree) that can no longer become incumbent and the second procedure is an indexing technique that works as a pointer for navigating the generated (enumeration) tree when it becomes too large. Numerical experiments on a number of networks show a substantially lower computation time compared to existing algorithms and the results provide several insights into the driving patterns of EVs. When charging time is increased, the EVs shift to paths that have a longer travel time but a shorter distance. Hence, the total network distance decreases but the total network travel time increases. We also show that unregulated expansion of the charging infrastructure can actually increase the total network travel time due to the presence of Braess’ paradox.

[1]  H. Z. Aashtiani.  The multi-modal traffic assignment problem. , 1979 .

[2]  Joseph Y. J. Chow,et al.  A multi-day activity-based inventory routing model with space–time–needs constraints , 2015 .

[3]  Patrick Plötz,et al.  A review of combined models for market diffusion of alternative fuel vehicles and their refueling infrastructure , 2015 .

[4]  Kurt Mehlhorn,et al.  Resource Constrained Shortest Paths , 2000, ESA.

[5]  Ali Zockaie,et al.  Planning charging infrastructure for plug-in electric vehicles in city centers , 2016 .

[6]  Joseph Y. J. Chow.  Activity‐Based Travel Scenario Analysis with Routing Problem Reoptimization , 2014, Comput. Aided Civ. Infrastructure Eng..

[7]  Martin W. P. Savelsbergh,et al.  Proactive route guidance to avoid congestion , 2016 .

[8]  Gilbert Laporte,et al.  Minimum cost path problems with relays , 2011, Comput. Oper. Res..

[9]  Kurt Mehlhorn,et al.  Faster algorithms for the shortest path problem , 1990, JACM.

[10]  Y. P. Aneja,et al.  Shortest chain subject to side constraints , 1983, Networks.

[11]  Nan Jiang,et al.  Computing and Analyzing Mixed Equilibrium Network Flows with Gasoline and Electric Vehicles , 2014, Comput. Aided Civ. Infrastructure Eng..

[12]  Nan Jiang,et al.  Relay Requirement and Traffic Assignment of Electric Vehicles , 2016, Comput. Aided Civ. Infrastructure Eng..

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

[14]  C. T. Tung,et al.  A multicriteria Pareto-optimal path algorithm , 1992 .

[15]  Chi Xie,et al.  Path-Constrained Traffic Assignment , 2012 .

[16]  Zuo-Jun Max Shen,et al.  Infrastructure Planning for Electric Vehicles with Battery Swapping , 2012 .

[17]  Stuart E. Dreyfus,et al.  An Appraisal of Some Shortest-Path Algorithms , 1969, Oper. Res..

[18]  T. Magnanti,et al.  A linearization and decomposition algorithm for computing urban traffic equilibria , 1983 .

[19]  Natashia Boland,et al.  Solving shortest path problems with a weight constraint and replenishment arcs , 2012, Comput. Oper. Res..

[20]  Joseph Ying Jun Chow,et al.  Stochastic Dynamic Itinerary Interception Refueling Location Problem with Queue Delay for Electric Taxi Charging Stations , 2014 .

[21]  R. K. Wood,et al.  Lagrangian relaxation and enumeration for solving constrained shortest-path problems , 2008 .

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

[23]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

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

[25]  Constantine Samaras,et al.  Life cycle assessment of greenhouse gas emissions from plug-in hybrid vehicles: implications for policy. , 2008, Environmental science & technology.

[26]  H. Joksch.  The shortest route problem with constraints , 1966 .

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

[28]  Fang He,et al.  Optimal deployment of public charging stations for plug-in hybrid electric vehicles , 2013 .

[29]  Yafeng Yin,et al.  Network equilibrium models with battery electric vehicles , 2014 .

[30]  Joseph Y. J. Chow,et al.  Inverse optimization with endogenous arrival time constraints to calibrate the household activity pattern problem , 2012 .

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

[32]  J. Romm.  The car and fuel of the future , 2006 .

[33]  Ali Zockaie,et al.  Optimization of incentive polices for plug-in electric vehicles , 2016 .

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

[35]  Kim Allan Andersen,et al.  A label correcting approach for solving bicriterion shortest-path problems , 2000, Comput. Oper. Res..

[36]  Matthew J. Roorda,et al.  Equilibrium scheduling of vehicle-to-grid technology using activity based modelling , 2016 .

[37]  Nakul Sathaye,et al.  An approach for the optimal planning of electric vehicle infrastructure for highway corridors , 2013 .

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