Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method

An alternate formulation of the classical vehicle routing problem with stochastic demands (VRPSD) is considered. We propose a new heuristic method to solve the problem, based on the Cross-Entropy method. In order to better estimate the objective function at each point in the domain, we incorporate Monte Carlo sampling. This creates many practical issues, especially the decision as to when to draw new samples and how many samples to use. We also develop a framework for obtaining exact solutions and tight lower bounds for the problem under various conditions, which include specific families of demand distributions. This is used to assess the performance of the algorithm. Finally, numerical results are presented for various problem instances to illustrate the ideas.

[1]  A. Kan,et al.  The stochastic vehicle routing problem revisited , 1992 .

[2]  Peter R. Nelson,et al.  Multiple Comparisons: Theory and Methods , 1997 .

[3]  Reuven Y. Rubinstein,et al.  Cross-entropy and rare events for maximal cut and partition problems , 2002, TOMC.

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

[5]  A. Tamhane,et al.  Multiple Comparison Procedures , 1989 .

[6]  Chun-Hung Chen,et al.  PROCEEDINGS OF THE 2002 WINTER SIMULATION CONFERENCE , 2002 .

[7]  Reuven Y. Rubinstein,et al.  Estimation of rare event probabilities using cross-entropy , 2002, Proceedings of the Winter Simulation Conference.

[8]  F. Tillman.  The Multiple Terminal Delivery Problem with Probabilistic Demands , 1969 .

[9]  Georg Ch. Pflug,et al.  Simulated Annealing for noisy cost functions , 1996, J. Glob. Optim..

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

[11]  Dimitris Bertsimas,et al.  Computational Approaches to Stochastic Vehicle Routing Problems , 1995, Transp. Sci..

[12]  Raymond A. Patterson,et al.  Heuristic procedure neural networks for the CMST problem , 2000, Comput. Oper. Res..

[13]  Gilbert Laporte,et al.  A Priori Optimization of the Probabilistic Traveling Salesman Problem , 1994, Oper. Res..

[14]  Gilbert Laporte,et al.  A Tabu Search Heuristic for the Vehicle Routing Problem , 1991 .

[15]  Moshe Dror,et al.  Stochastic vehicle routing with modified savings algorithm , 1986 .

[16]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

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

[18]  John Holt,et al.  New optimality cuts for a single‐vehicle stochastic routing problem , 1999, Ann. Oper. Res..

[19]  S. Andradóttir,et al.  A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization , 1999 .

[20]  Bruce L. Golden,et al.  A Framework For Probabilistic Vehicle Routing , 1979 .

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

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

[23]  Shie Mannor,et al.  A Tutorial on the Cross-Entropy Method , 2005, Ann. Oper. Res..

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

[25]  Georg Ch. Pflug,et al.  Optimal stochastic single-machine-tardiness scheduling by stochastic branch-and-bound , 1999, Eur. J. Oper. Res..

[26]  Moshe Dror,et al.  Stochastic Inventory Routing: Route Design with Stockouts and Route Failures , 1989, Transp. Sci..

[27]  Mahmoud H. Alrefaei,et al.  A modification of the stochastic ruler method for discrete stochastic optimization , 2001, Eur. J. Oper. Res..

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

[29]  D. Yan,et al.  Stochastic discrete optimization , 1992 .

[30]  B. Fox,et al.  Probabilistic Search with Overrides , 1995 .

[31]  G. Clarke,et al.  Scheduling of Vehicles from a Central Depot to a Number of Delivery Points , 1964 .

[32]  Dimitris Bertsimas,et al.  COMPUTATIONAL APPROACHES TO STOCHASTIC VEHICLE ROUTING , 1995 .

[33]  Benjamin W. Wah,et al.  Scheduling of Genetic Algorithms in a Noisy Environment , 1994, Evolutionary Computation.

[34]  Dirk P. Kroese,et al.  Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment , 2005, Ann. Oper. Res..

[35]  S. Andradóttir.  A method for discrete stochastic optimization , 1995 .

[36]  Laurence A. Wolsey,et al.  Integer and Combinatorial Optimization , 1988, Wiley interscience series in discrete mathematics and optimization.

[37]  A. Tamhane.  Design and Analysis of Experiments for Statistical Selection, Screening, and Multiple Comparisons , 1995 .

[38]  Sigrún Andradóttir,et al.  A Global Search Method for Discrete Stochastic Optimization , 1996, SIAM J. Optim..

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

[40]  Tito Homem-de-Mello,et al.  A Study on the Cross-Entropy Method for Rare-Event Probability Estimation , 2007, INFORMS J. Comput..

[41]  S. Mitter,et al.  Simulated annealing with noisy or imprecise energy measurements , 1989 .

[42]  W. Gong,et al.  Genetic algorithms with noisy fitness , 1996 .

[43]  Dimitris Bertsimas,et al.  Vehicle Routing Problem with Stochastic Demand , 2017 .

[44]  Anne Lohrli.  Chapman and Hall , 1985 .

[45]  R. Rubinstein.  The Cross-Entropy Method for Combinatorial and Continuous Optimization , 1999 .

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

[47]  Barry L. Nelson,et al.  A combined procedure for optimization via simulation , 2002, Proceedings of the Winter Simulation Conference.