Optimal routing for electric vehicle service systems

Abstract There is increased interest in deploying charging station infrastructure for electric vehicles, due to the increasing adoption of such vehicles to reduce emissions. However, there are a number of key challenges for providing high quality of service to such vehicles, stemming from technological reasons. One of them is due to the relative slow charging times and the other is due to the relative limited battery range. Hence, developing efficient routing strategies of electric vehicles requesting charging to stations that have available charging resources is an important component of the infrastructure. In this work, we propose a queueing modeling framework for the problem at hand and develop such routing strategies that optimise a performance metric related to vehicles’ sojourn time in the system. By incorporating appropriate weights into the well-known dynamic routing discipline “Join-the-Shortest-Queue”, we show that the proposed routing strategies not only do they maximise the queueing system’s throughput, but also significantly mitigate the vehicle’s sojourn time. The strategies are also adaptive in nature and responsive to changes in the speed of charging at the stations, the distribution of the vehicles’ point of origin when requesting service, the traffic congestion level and the vehicle speed; all the above are novel aspects and compatible with the requirements of a modern electric vehicle charging infrastructure.

[1]  Sigrid Knust,et al.  Minimizing costs in round robin tournaments with place constraints , 2009, Comput. Oper. Res..

[2]  Denis Borenstein,et al.  Real-time vehicle rerouting problems with time windows , 2009, Eur. J. Oper. Res..

[3]  George B. Dantzig,et al.  The Truck Dispatching Problem , 1959 .

[4]  Patrick Jaillet,et al.  Generalized Online Routing: New Competitive Ratios, Resource Augmentation, and Asymptotic Analyses , 2008, Oper. Res..

[5]  R. E. Mortensen Stochastic Stability and Control (Harold J. Kushner) , 1968 .

[6]  J. P. Lasalle,et al.  Stability and Control , 1962 .

[7]  Nicholas Bambos,et al.  Queueing Dynamics and Maximal Throughput Scheduling in Switched Processing Systems , 2003, Queueing Syst. Theory Appl..

[8]  Gilbert Laporte,et al.  STOCHASTIC VEHICLE ROUTING. , 1996 .

[9]  I. Agency,et al.  World Energy Outlook 2000 , 2000 .

[10]  J. Baras,et al.  Two competing queues with linear costs: the μc-rule is often optimal , 1984, Advances in Applied Probability.

[11]  Jean-Charles Billaut,et al.  A tabu search heuristic for the dynamic transportation of patients between care units , 2011, Eur. J. Oper. Res..

[12]  Gilbert Laporte,et al.  Fifty Years of Vehicle Routing , 2009, Transp. Sci..

[13]  George Michailidis,et al.  Modeling, scheduling, and simulation of switched processing systems , 2008, TOMC.

[14]  David Simchi-Levi,et al.  A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty , 1996, Oper. Res..

[15]  George Michailidis,et al.  Stability and Control of Acyclic Stochastic Processing Networks With Shared Resources , 2012, IEEE Transactions on Automatic Control.

[16]  Paolo Toth,et al.  Recent advances in vehicle routing exact algorithms , 2007, 4OR.

[17]  Dimitris Bertsimas,et al.  A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane , 1991, Oper. Res..

[18]  Srdjan M. Lukic,et al.  Energy Storage Systems for Automotive Applications , 2008, IEEE Transactions on Industrial Electronics.

[19]  Michael Devetsikiotis,et al.  An adaptive approach to accelerated evaluation of highly available services , 2007, TOMC.

[20]  Emilio Frazzoli,et al.  Decentralized algorithms for stochastic and dynamic vehicle routing with general demand distribution , 2007, 2007 46th IEEE Conference on Decision and Control.

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

[22]  Michel Gendreau,et al.  A review of dynamic vehicle routing problems , 2013, Eur. J. Oper. Res..

[23]  Rong Wu,et al.  Round robin scheduling of heterogeneous parallel servers in heavy traffic , 2009, Eur. J. Oper. Res..

[24]  Gilbert Laporte,et al.  What you should know about the vehicle routing problem , 2007 .

[25]  J. Baras,et al.  Two competing queues with linear costs and geometric service requirements: the μc-rule is often optimal , 1985, Advances in Applied Probability.

[26]  Qiuwei Wu,et al.  Direct Load Control (DLC) Considering Nodal Interrupted Energy Assessment Rate (NIEAR) in Restructured Power Systems , 2010, IEEE Transactions on Power Systems.

[27]  Mark Alexander,et al.  Evaluations of plug-in electric vehicle distribution system impacts , 2010, IEEE PES General Meeting.

[28]  Michel Gendreau,et al.  A pro-active real-time control approach for dynamic vehicle routing problems dealing with the delivery of urgent goods , 2013, Eur. J. Oper. Res..

[29]  J. Oyarzabal,et al.  A Direct Load Control Model for Virtual Power Plant Management , 2009, IEEE Transactions on Power Systems.

[30]  M. Thring World Energy Outlook , 1977 .

[31]  George Kesidis,et al.  Incentive-Based Energy Consumption Scheduling Algorithms for the Smart Grid , 2010, 2010 First IEEE International Conference on Smart Grid Communications.

[32]  W. Devon ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ ★ 2050 , 2010 .

[33]  M. M. Flood The Traveling-Salesman Problem , 1956 .

[34]  D. Bertsimas,et al.  Stochastic and dynamic vehicle routing with general demand and interarrival time distributions , 1993, Advances in Applied Probability.

[35]  J. Walrand,et al.  The cμ rule revisited , 1985, Advances in Applied Probability.