A Practical Approach for Robust and Flexible Vehicle Routing Using Metaheuristics and Monte Carlo Sampling

In this paper, we investigate how robust and flexible solutions of a number of stochastic variants of the capacitated vehicle routing problem can be obtained. To this end, we develop and discuss a method that combines a sampling based approach to estimate the robustness or flexibility of a solution with a metaheuristic optimization technique. This combination allows us to solve larger problems with more complex stochastic structures than traditional methods based on stochastic programming. It is also more flexible in the sense that adaptation of the approach to more complex problems can be easily done. We explicitly recognize the fact that the decision maker’s risk preference should be taken into account when choosing a robust or flexible solution and show how this can be done using our approach.

[1]  Paolo Toth,et al.  The Vehicle Routing Problem , 2002, SIAM monographs on discrete mathematics and applications.

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

[3]  Gilbert Laporte,et al.  Designing collection routes through bank branches , 1991, Comput. Oper. Res..

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

[5]  Philippe Artzner,et al.  Coherent Measures of Risk , 1999 .

[6]  Gilbert Laporte,et al.  A branch‐and‐regret heuristic for stochastic and dynamic vehicle routing problems , 2007, Networks.

[7]  Marc Reimann,et al.  Analysing risk orientation in a stochastic VRP , 2007 .

[8]  Andrzej Ruszczynski,et al.  On Optimal Allocation of Indivisibles Under Uncertainty , 1998, Oper. Res..

[9]  Alexander Shapiro,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002, SIAM J. Optim..

[10]  K. Sörensen,et al.  A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design , 2003 .

[11]  Averill M. Law,et al.  Simulation Modeling and Analysis , 1982 .

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

[13]  Luis C. Dias,et al.  On computing ELECTRE's credibility indices under partial information , 1999 .

[14]  Tito Homem-de-Mello,et al.  Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method , 2005, Ann. Oper. Res..

[15]  Philippe Vincke,et al.  Robust solutions and methods in decision‐aid , 1999 .

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

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

[18]  Robert J. Vanderbei,et al.  Robust Optimization of Large-Scale Systems , 1995, Oper. Res..

[19]  Alexander Shapiro,et al.  The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study , 2003, Comput. Optim. Appl..

[20]  Kenneth Sörensen,et al.  Investigation of practical, robust and flexible decisions for facility location problems using tabu search and simulation , 2008, J. Oper. Res. Soc..

[21]  John R. Birge,et al.  Stochastic Programming Computation and Applications , 1997, INFORMS J. Comput..

[22]  Nicola Secomandi,et al.  Analysis of a Rollout Approach to Sequencing Problems with Stochastic Routing Applications , 2003, J. Heuristics.

[23]  Tito Homem-de-Mello,et al.  Variable-sample methods for stochastic optimization , 2003, TOMC.

[24]  Michael J. Fischer,et al.  The String-to-String Correction Problem , 1974, JACM.

[25]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[26]  Ravi Jagannathan,et al.  Use of Sample Information in Stochastic Recourse and Chance-Constrained Programming Models , 1985 .

[27]  Julia L. Higle,et al.  Stochastic Decomposition: An Algorithm for Two-Stage Linear Programs with Recourse , 1991, Math. Oper. Res..

[28]  Kenneth Sörensen,et al.  Route stability in vehicle routing decisions: a bi-objective approach using metaheuristics , 2006, Central Eur. J. Oper. Res..

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

[30]  Bruce L. Golden,et al.  Stochastic vehicle routing: A comprehensive approach , 1983 .

[31]  Luca Maria Gambardella,et al.  A survey on metaheuristics for stochastic combinatorial optimization , 2009, Natural Computing.

[32]  G. Infanger,et al.  Planning under uncertainty solving large-scale stochastic linear programs , 1992 .

[33]  S. K. Mishra,et al.  Nonconvex Optimization and Its Applications , 2008 .

[34]  Christian Prins,et al.  A simple and effective evolutionary algorithm for the vehicle routing problem , 2004, Comput. Oper. Res..

[35]  Randall P. Sadowski,et al.  Simulation with Arena , 1998 .

[36]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[37]  Jürgen Branke,et al.  Evolutionary Optimization in Dynamic Environments , 2001, Genetic Algorithms and Evolutionary Computation.

[38]  K. Sörensen,et al.  Memetic algorithms with population management , 2006 .

[39]  Georg Ch. Pflug,et al.  A branch and bound method for stochastic global optimization , 1998, Math. Program..

[40]  Alan J. Stenger,et al.  Comparing strategies for addressing delivery shortages in stochastic demand settings , 1999 .

[41]  Nicola Secomandi,et al.  Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands , 2000, Comput. Oper. Res..

[42]  Michael A. Haughton The performance of route modification and demand stabilization strategies in stochastic vehicle routing , 1998 .

[43]  Bernard Roy,et al.  A missing link in OR-DA : robustness analysis , 1998 .

[44]  ShapiroAlexander,et al.  The Sample Average Approximation Method for Stochastic Discrete Optimization , 2002 .

[45]  Moshe Dror,et al.  Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks , 1989, Transp. Sci..

[46]  Moshe Dror,et al.  Vehicle routing with stochastic demands and restricted failures , 1992, ZOR Methods Model. Oper. Res..

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