A Paired-Vehicle Recourse Strategy for the Vehicle-Routing Problem with Stochastic Demands

Published Online:https://doi.org/10.1287/trsc.1060.0180

References

  • Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40:574–585LinkGoogle Scholar
  • Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44:286–303LinkGoogle Scholar
  • Dror M., Trudeau P. Stochastic vehicle routing with a modified savings algorithm. Eur. J. Oper. Res. (1986) 23:228–235CrossrefGoogle Scholar
  • Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23:166–176LinkGoogle Scholar
  • Erera A. L. Design of large-scale logistics systems for uncertain environments. (2000) . Ph.D. thesis, Department of Industrial Engineering and Operations Research, University of California-Berkeley, Berkeley, CAGoogle Scholar
  • Erera A. L., Daganzo C. F. A dynamic scheme for stochastic vehicle routing. Transportation Sci. (2003) . ForthcomingGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. An exact algorithm for the vehicle routing problem with stochastic demands and customers. Transportation Sci. (1995) 29:143–155LinkGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. (1996a) 44:469–477LinkGoogle Scholar
  • Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996b) 88:3–12CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V. The integer l-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142CrossrefGoogle Scholar
  • Laporte G., Nobert Y. A cutting planes algorithm for the m-salesman problem. J. Oper. Res. Soc. (1980) 31:1017–1023CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V., Mercure H. Models and exact solutions for a class of stochastic location-routing problems. Eur. J. Oper. Res. (1989) 39:71–78CrossrefGoogle Scholar
  • Laporte G., Louveaux F. V., Van Hamme L. An integer l-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. (2002) 50:415–423LinkGoogle Scholar
  • Stewart W., Golden B. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14:371–385CrossrefGoogle Scholar
  • Verweij B., Ahmed S., Kleywegt A., Nemhauser G., Shapiro A. The sample average approximation method applied to stochastic routing problems: A computational study. Comput. Optim. Appl. (2003) 24:289–333CrossrefGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.