Dynamic Vehicle Routing under Uncertain Travel Costs and Refueling Opportunities

We study the vehicle routing problem for a system where there is some uncertainty regarding both the cost of travel and the refueling opportunities. Travel cost stands for the energy spent by the vehicle to move between locations. Refueling opportunities are offered at known locations where the vehicle can harvest or re-gain some of the lost energy. The objective is to visit a set of predefined locations without exhausting the energy of the vehicle. We describe the problem in a formal way, and propose a heuristic algorithm for taking routing decisions at runtime. We evaluate the algorithm for a grid topology as a function of the number of locations to be visited and the autonomy degree of the vehicle, showing that the proposed algorithm achieves good results as long as the energy margins are not very tight.

[1]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[2]  Michel Gendreau,et al.  A path relinking algorithm for a multi-depot periodic vehicle routing problem , 2013, J. Heuristics.

[3]  Tom Van Woensel,et al.  Vehicle routing problem with stochastic travel times including soft time windows and service costs , 2013, Comput. Oper. Res..

[4]  David P. Morton,et al.  Stochastic Vehicle Routing with Random Travel Times , 2003, Transp. Sci..

[5]  Douglas Moura Miranda,et al.  The vehicle routing problem with hard time windows and stochastic travel and service time , 2016, Expert Syst. Appl..

[6]  Jan Fabian Ehmke,et al.  Ensuring service levels in routing problems with time windows and stochastic travel times , 2015, Eur. J. Oper. Res..

[7]  Paolo Toth,et al.  A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem , 2014, J. Heuristics.

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

[9]  Gilbert Laporte,et al.  An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands , 2002, Oper. Res..

[10]  Giuseppe Paletta,et al.  A Heuristic for the Periodic Vehicle Routing Problem , 1992, Transp. Sci..

[11]  Martin Sachenbacher,et al.  The optimal routing problem in the context of battery-powered electric vehicles , 2010 .

[12]  Anouck Girard,et al.  Persistent Visitation with Fuel Constraints , 2012 .

[13]  Martin W. P. Savelsbergh,et al.  The Vehicle Routing Problem with Stochastic Demand and Duration Constraints , 2010, Transp. Sci..

[14]  Dimitris Bertsimas,et al.  A Vehicle Routing Problem with Stochastic Demand , 1992, Oper. Res..

[15]  John E. Beasley,et al.  A tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions , 2008, J. Oper. Res. Soc..

[16]  Gilbert Laporte,et al.  The Vehicle Routing Problem with Stochastic Travel Times , 1992, Transp. Sci..

[17]  Michel Gendreau,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers , 1996, Oper. Res..

[18]  G. Laporte,et al.  A tabu search heuristic for periodic and multi-depot vehicle routing problems , 1997, Networks.

[19]  Michel Gendreau,et al.  A Hybrid Genetic Algorithm for Multidepot and Periodic Vehicle Routing Problems , 2012, Oper. Res..

[20]  Nicola Secomandi,et al.  A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands , 2001, Oper. Res..

[21]  Magdalene Marinaki,et al.  A Glowworm Swarm Optimization algorithm for the Vehicle Routing Problem with Stochastic Demands , 2016, Expert Syst. Appl..

[22]  Michel Gendreau,et al.  A Hybrid Monte Carlo Local Branching Algorithm for the Single Vehicle Routing Problem with Stochastic Demands , 2010, Transp. Sci..

[23]  Gilbert Laporte,et al.  An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers , 1995, Transp. Sci..

[24]  Russell Bent,et al.  Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers , 2004, Oper. Res..

[25]  M. Held,et al.  A dynamic programming approach to sequencing problems , 1962, ACM National Meeting.

[26]  Michel Gendreau,et al.  Vehicle routing with soft time windows and stochastic travel times: A column generation and branch-and-price solution approach , 2014, Eur. J. Oper. Res..

[27]  Magdalene Marinaki,et al.  Particle Swarm Optimization for the Vehicle Routing Problem with Stochastic Demands , 2013, Appl. Soft Comput..

[28]  Louis-Martin Rousseau,et al.  A hybrid metaheuristic for the vehicle routing problem with stochastic demand and duration constraints , 2016, J. Heuristics.

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

[30]  Angel A. Juan,et al.  Using safety stocks and simulation to solve the vehicle routing problem with stochastic demands , 2011 .

[31]  Maria Grazia Speranza,et al.  The periodic vehicle routing problem with intermediate facilities , 2002, Eur. J. Oper. Res..