Reoptimization approaches for the vehicle-routing problem with stochastic demands

Operations Research

Volumn 57, Issue 1, 2009, Pages 214-230

  Secomandi, Nicola ^a   Margot, François ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Dynamic programming: Application, heuristics; Network graphs: Stochastic model; Transportation: Vehicle routing problem, stochastic demands

Indexed keywords

COMPUTATIONALLY EFFICIENT; CUSTOMER DEMANDS; DYNAMIC PROGRAMMING: APPLICATION, HEURISTICS; FINITE-HORIZON MARKOV DECISION PROCESS; HEURISTIC SOLUTIONS; LOWER BOUNDS; NETWORK/GRAPHS: STOCHASTIC MODEL; OPTIMAL POLICIES; PARTIAL CHARACTERIZATIONS; REOPTIMIZATION;

CONTROL THEORY; DYNAMIC PROGRAMMING; HEURISTIC METHODS; RANDOM PROCESSES; STOCHASTIC CONTROL SYSTEMS; SYSTEMS ENGINEERING; VEHICLE ROUTING; VEHICLES;

STOCHASTIC MODELS;

EID: 61449101310     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.1080.0520     Document Type: Article

References (49)

1. Adelman, D. 2003. Price-directed replenishment of subsets: Methodology and its application to inventory routing. Manufacturing Service Oper. Management 5 348-371.
2. Adelman, D. 2004. A price-directed approach to stochastic/inventory routing. Oper. Res. 52 499-514.
3. Adelman, D. 2006. Math programming approaches to approximate dynamic programming. Tutorial, INFORMS Annual Meeting, Pittsburgh, PA.
4. Balas, E. 1999. New classes of efficiently solvable generalized traveling salesman problems. Ann. Oper. Res. 86 529-558.
5. Balas, E., N. Simonetti. 2001. Linear-time dynamic-programming algorithms for new classes of restricted TSPs: A computational study. INFORMS J. Comput. 13 56-75.
6. Bertsekas, D. P. 2000. Dynamic Programming and Optimal Control, Vol. 1. Athena Scientific, Belmont, MA.
7. Bertsekas, D. P., D. A. Castanon. 1999. Rollout algorithms for stochastic scheduling problems. J. Heuristics 5 89-108.
8. Bertsekas, D. P., J. N. Tsitsiklis. 1996. Neuro-Dynamic Programming. Athena Scientific, Belmont, MA.
9. Bertsekas, D. P., J. N. Tsitsiklis, C. Wu. 1997. Rollout algorithms for combinatorial optimization. J. Heuristics 3 245-262.
10. Bertsimas, D. J. 1992. A vehicle routing problem with stochastic demands. Oper: Res. 40 574-585.
11. Bertsimas, D. J., D. Simchi-Levi. 1996. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. 44 286-304.
12. Bertsimas, D. J., P. Chervi, M. Peterson. 1995. Computational approaches to stochastic vehicle routing problems. Transportation Sci. 29 342-352.
13. Chan, Y., W. B. Carter, M. D. Burnes. 2001. A multi-depot, multiplevehicle, location-routing problem with stochastically processed demands. Comput. Oper. Res. 28 803-826.
14. Desrosiers, J., Y. Dumas, M. M. Solomon, F. Soumis. 1995. Time constrained routing and scheduling. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 35-139.
15. Dror, M. 1993. Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. Eur: J. Oper. Res. 64 432-441.
16. Dror, M. 2002. Vehicle routing with stochastic demands: Models and computational methods. M. Dror, P. L'Ecuyer, F. Szidarouszky, eds. Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications. International Series in Operations Research and Management Science, Vol. 46. Kluwer, Boston, 625-649.
17. Dror, M., P. Trudeau. 1986. Stochastic vehicle routing with modified savings algorithm. Eur: J. Oper. Res. 23 228-235.
18. Dror, M., G. Laporte, F. Louveaux. 1993. Vehicle routing with stochastic demands and restricted failures. ZOR-Methods Models Oper. Res. 37 273-283.
19. Dror, M., G. Laporte, P. Trudeau. 1989. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. 23 166-176.
20. Fisher, M. 1995. Vehicle routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 1-33.
21. Gendreau, M., G. Laporte, R. Séguin. 1995. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. 29 143-155.
22. Gendreau, M., G. Laporte, R. Séguin. 1996. Stochastic vehicle routing. Eur: J. Oper. Res. 88 3-12.
23. Geoffrion, A. M., T. J. Van Roy. 1979. Caution: Common sense planning mediods can be hazardous to your corporate health. Sloan Management Rev. 20 31-42.
24. Glover, F., M. Laguna. 1997. Tabu Search. Kluwer Academic Publishers, Boston.
25. Golden, B. L., A. A. Assad. 1988. Vehicle Routing: Methods and Studies. North-Holland, Amsterdam.
26. Hjorring, C., J. Holt. 1999. New optimality cuts for a single-vehicle stochastic routing problem. Ann. Oper: Res. 86 569-584.
27. Kleywegt, A. J., V. S. Nori, M. W. P. Savelsbergh. 2004. Dynamic programming approximations for a stochastic inventory routing problem. Transportation Sci. 38 42-70.
28. Ladányi, L., T. K. Ralphs, L. E. Trotter Jr. 2001. Branch, cut, and price: Sequential and parallel. D. Naddef, M. Juenger, eds. Computational Combinatorial Optimization. Springer, Berlin, 223-260.
29. Laporte, G., F. V. Louveaux, L. Van Hamme. 2002. An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper: Res. 50 415-423.
30. Nahmias, S. 2005. Production and Operations Analysis. McGraw-Hill/Irwin, New York.
31. Powell, W. B. 2003. Dynamic models of transportation operations. A. G. de Kok, S. C. Graves, eds. Supply Chain Management: Design, Coordination and Operation. Handbooks in Operations Research and Management Science, Vol. 11. Elsevier, Amsterdam, 677-756.
32. Powell, W. B. 2007. Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley-Interscience, Hoboken, NJ.
33. Powell, W. B., P. Jaillet, A. Odoni. 1995. Stochastic and dynamic networks and routing. M. O. Ball, T. L. Magnanti, C. L. Monma, G. L. Nemhauser, eds. Network Routing. Handbooks in Operations Research and Management Science, Vol. 8. Elsevier, Amsterdam, 141-295.
34. Psaraftis, N. 1995. Dynamic vehicle routing: Status and prospects. Ann. Oper. Res. 61 143-164.
35. Puterman, M. L. 1994. Markov Decision Processes: Discrete Stochastic Dynamic Programming. John. Wiley & Sons, New York.
36. Ralphs, T. K. 2003. Parallel branch and cut for capacitated vehicle routing. Parallel Comput. 29 607-629.
37. Secomandi, N. 1998. Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. Ph.D. dissertation, University of Houston, Houston.
38. Secomandi, N. 2000. Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands. Comput. Oper: Res. 27 1201-1225.
39. Secomandi, N. 200.1. A rollout policy for the vehicle routing problem with stochastic demands. Oper: Res. 49 796-802.
40. Secomandi, N. 2003. Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics 9 321-352.
41. Singer, M., P. Donoso, S. Jara. 2002. Fleet configuration subject to stochastic demand: An application in the distribution of liquefied petroleum gas. J. Oper: Res. Soc. 53 961-971.
42. Stewart, W. R., B. L. Golden. 1983. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. 14 371-385.
43. Sutton, R. S., A. G. Barto. 1998. Reinforcement Learning. MIT Press, Cambridge, MA.
44. Toth, P., D. Vigo. 2002. The Vehicle Routing Problem. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia.
45. Trudeau, P., M. Dror. 1992. Stochastic inventory routing: Route design with stockouts and route failures. Transportation Sci. 26 171-184.
46. White, C. C., D. J. White. 1989. Markov decision processes. Eur: J. Oper: Res. 39 1-16.
47. Whitt, W. 1978. Approximations of dynamic programs, I. Math. Oper. Res. 3 231-243.
48. Whitt, W. 1979. Approximations of dynamic programs, II. Math. Oper. Res. 4 179-185.
49. Yang, W.-H., K. Mathur, R. H. Bailou. 2000. Stochastic vehicle routing problem with restocking. Transportation Sci. 34 99-112.