Annals of Operations Research

, Volume 134, Issue 1, pp 153–181 | Cite as

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

Article

Abstract

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.

Key words

vehicle routing problem stochastic optimization cross-entropy method 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aizawa, A.N. and B.W. Wah. (1994). “Scheduling of Genetic Algorithms in a Noisy Environment.” Evolutionary Computation 2, 97–122.Google Scholar
  2. Allen, T.T. and W. Ittiwattana. (2002). “An Elitist Genetic Algorithm Incorporating Sequential Subset Selection.” Manuscript, The Ohio State University.Google Scholar
  3. Alon, G., D.P. Kroese, T. Raviv, and R.Y. Rubinstein. (2005). “Application of the Cross-Entropy Method to the Buffer Allocation Problem in a Simulation-Based Environment.” Annals of Operations Research 134, 137–151.CrossRefGoogle Scholar
  4. Alrefaei, M.H. and S. Andradottir. (1999). “A Simulated Annealing Algorithm with Constant Temperature for Discrete Stochastic Optimization.” Management Science 45, 748–764.Google Scholar
  5. Alrefaei, M.H. and S. Andradottir. (2001). “A Modification of the Stochastic Ruler Method for Discrete Stochastic Optimization.” European Journal of Operational Research 133, 160–182.CrossRefGoogle Scholar
  6. Andradottir, S. (1995). “A Method for Discrete Stochastic Optimization.” Management Science 41, 1946–1961.Google Scholar
  7. Andradottir, S. (1996). “A Global Search Method for Discrete Stochastic Optimization.” SIAM Journal on Optimization 6, 513–530.CrossRefGoogle Scholar
  8. Bastian, C. and R. Kan. (1992). “The Stochastic Vehicle Routing Problem Revisited.” European Journal of Operational Research 56, 407–412.CrossRefGoogle Scholar
  9. Bechhofer, R.E and T.J. Santner. (1995). Design and Analysis of Experiments for Statistical Selection, Screening and Multiple Comparisons. Wiley.Google Scholar
  10. Bertsimas, D. (1992). “A Vehicle Routing Problem with Stochastic Demand.” Operations Research 40, 574–585.Google Scholar
  11. Bertsimas, D., P. Chervi, and M. Peterson. (1995). “Computational Approaches to Stochastic Vehicle Routing Problems.” Transportation Science 29, 342–352.Google Scholar
  12. Chepuri, K. and T. Homem-de-Mello. (2003). “Solving the Vehicle Routing Problem with Stochastic Demands using the Cross-Entropy Method.” Manuscript, Ohio State University.Google Scholar
  13. Chepuri, K. (2003). “Solving the Vehicle Routing Problem with Stochastic Demands Using the Cross-Entropy Method.” Master’s thesis, Ohio State University.Google Scholar
  14. Clark, G. and J.W. Wright. (1964). “Scheduling of Vehicles from a Central Depot to a Number of Delivery Points.” Operations Research 12, 568–581.Google Scholar
  15. de Boer, P.T. D.P. Kroese, S. Mannor, and R.Y. Rubinstein. (2005). “A Tutorial on the Cross-Entropy Method.” Annals Of Operations Research 134, 19–67.CrossRefGoogle Scholar
  16. Dror, M. and P. Trudeau. (1986). “Stochastic Vehicle Routing with Modified Savings Algorithm.” European Journal of Operational Research 23, 228–235.CrossRefGoogle Scholar
  17. Fox B.L. and G.W. Heine. (1995). “Probabilistic Search with Overrides.” Annals of Applied Probability 5, 1087–1094.Google Scholar
  18. Gelfland, S.B. and S.K. Mitter. (1989). “Simulated Annealing with Noisy or Imprecise Energy Measurements.” JOTA 62, 49–62.CrossRefGoogle Scholar
  19. Gendreau, M.G. Laporte, and R. Seguin. (1995). “An Exact Algorithm for the Vehicle Routing Problem with Stochastic Demands and Customers.” Transportation Science 29, 143–155.Google Scholar
  20. Gendreau, M., G. Laporte, and R. Seguin. (1996a). “Invited Review: Stochastic Vehicle Routing.” European Journal of Operational Research 88, 3–12.CrossRefGoogle Scholar
  21. Gendreau, M., G. Laporte, and R. Seguin. (1996b). “A Tabu Search Heuristic for the Vehicle Routing Problem with Stochastic Demands and Customers.” Operations Research 44, 469–477.Google Scholar
  22. Golden, B.L. and J.R. Yee. (1979). “A Framework for Probabilistic Vehicle Routing.” AIIE Transactions 11, 109–112.Google Scholar
  23. Gutjahr, W.J. and G.C. Pflug. (1996). “Simulated Annealing for Noisy Cost Functions.” Journal of Global Optimization 8, 1–13.CrossRefGoogle Scholar
  24. Gutjahr, W.J., A. Hellmayr, and G.C. Pflug. (1999). “Optimal Stochastic Single-Machine Tardiness Scheduling by Stochastic Branch and Bound.” European Journal of Operational Research 117, 396–413.CrossRefGoogle Scholar
  25. Hjorring, C. and J. Holt. (1999). “New Optimality Cuts for a Single-Vehicle Stochastic Routing Problem.” Annals of Operations Research 86, 569–584.CrossRefGoogle Scholar
  26. Hochberg, Y. and A.C. Tamhane. (1987) Multiple Comparison Procedures. Wiley.Google Scholar
  27. Homem-de-Mello, T. and R.Y. Rubinstein. (2002). “Rare Event Probability Estimation Using Cross-Entropy.” In Proceedings of the 2002 Winter Simulation Conference, E. Yucesan, C.-H. Chen, J.L. Snowdon, and J.M. Charnes (eds.), pp. 310–319.Google Scholar
  28. Homem-de-Mello, T. (2001). “On Convergence of Simulated Annealing for Discrete Stochastic Optimization.” Manuscript, Ohio State University.Google Scholar
  29. Homem-de-Mello, T. (2003). “Variable-Sample Methods for Stochastic Optimization.” ACM Transactions on Modeling and Computer Simulation 13, 108–133.CrossRefGoogle Scholar
  30. Hsu, J.C. (1996) Multiple Comparisons, Theory and Methods. Chapman and Hall.Google Scholar
  31. Kleywegt, A., A. Shapiro, and T. Homem-de-Mello. (2001). “The Sample Average Approximation Method for Stochastic Discrete Optimization.” SIAM Journal on Optimization 12(2), 479–502.CrossRefGoogle Scholar
  32. Laporte, G. and F.V. Louveaux. (1990) Formulations and Bounds for the Stochastic Capacitated Vehicle Routing Problem with Uncertain Supplies. Wolsey, North Holland, Amsterdam, first edition.Google Scholar
  33. Laporte, G. F.V. Louveaux, and H. Mercure. (1989). “Models and Exact Solutions for a Class of Stochastic location-Routing Problems.” European Journal of Operational Research 39, 71–78.CrossRefGoogle Scholar
  34. Laporte, G., F.V. Louveaux, and H. Mercure. (1992). “The Vehicle Routing Problem with Stochastic Travel Times.” Transportation Science 26, 161–170.Google Scholar
  35. Laporte, G., F.V. Louveaux, and H. Mercure. (1994). “A Priori Optimization of the Probabilistic Traveling Salesman Problem.” Operations Research 42, 543–549.Google Scholar
  36. Margolin, L. (2002). “Cross-Entropy Method for Combinatorial Optimization.” Master’s thesis, Technion—Israel Institute of Technology.Google Scholar
  37. Nemhauser, G.L. and L.A. Wolsey. (1988) Integer and Combinatorial Optimization. Wiley, New York, NY.Google Scholar
  38. Pichitlamken, J. and B.L. Nelson. (2002). “A Combined Procedure for Optimization Via Simulation.” Manuscript, Northwestern University.Google Scholar
  39. Rubinstein, R.Y. (1999). “The Cross-Entropy Method for Combinatorial and Continous Optimization.” Methodology and Computing in Applied Probability 2, 127–190.CrossRefGoogle Scholar
  40. Rubinstein, R.Y. (2002). “Cross-Entropy and Rare Events for Maximal Cut and Bipartition Problems.” ACM Transactions on Modeling and Computer Simulation 12, 27–53.CrossRefGoogle Scholar
  41. Secomandi, N. (2000). “Comparing Neuro-Dynamic Programming Algosithms for the Vehicle Routing Problem with Stochastic Demands.” Computers and Operations Research 27, 1171–1200.CrossRefGoogle Scholar
  42. Secomandi, N. (2001). “A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands.” Operations Research 49, 796–802.CrossRefGoogle Scholar
  43. Stewart Jr., W.R. and B.L. Golden. (1983). “Stochastic Vehicle Routing.” European Journal of Operational Research 14, 371–385.CrossRefGoogle Scholar
  44. Tillman, F. (1969). “The Multiple Terminal Delivery Problem with Probabilistic Demands.” Transportation Science 3, 192–204.Google Scholar
  45. Trudeau, P. and M. Dror. (1992). “Stochastic Inventory Routing: Route Design with Stockouts and Route Failure.” Transportation Science 26, 171–184.CrossRefGoogle Scholar
  46. Yan, D. and H. Mukai. (1992). “Discrete Stochastic Optimization.” SIAM Journal on Control and Optimization 30, 594–612.CrossRefGoogle Scholar
  47. Zhai, W., P. Kelly, and W.B. Gong. (1996). “Genetic Algorithms with Noisy Fitness.” Mathematical Computer Modelling 23, 131–142.CrossRefGoogle Scholar

Copyright information

© Springer Science + Business Media, Inc. 2005

Authors and Affiliations

  1. 1.Decision Analysis & Portfolio ManagementJ&J PRDTitusvile
  2. 2.Department of Industrial Engineering and Management SciencesNorthwestern UniversityEvanston

Personalised recommendations