An Integer L-Shaped Algorithm for the Capacitated Vehicle Routing Problem with Stochastic Demands

References

• Augerat P., Belenguer J. M., Benavent E., Corberán A., Naddef D., Rinaldi G. Computational results with a branch and cut code for the capacitated vehicle routing problem. (1995) . Technical report RR949-M, ARTEMIS-IMAG, Grenoble, FranceGoogle Scholar
• Bastian C., Rinnooy Kan A. H. G. The stochastic vehicle routing problem revisited. Eur. J. Oper. Res. (1992) 56:407–412Crossref, Google Scholar
• Benders J. F. Partitioning procedures for solving mixedvariables programming problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40(3):574–585Link, Google Scholar
• Bertsimas D. J., Chervi P., Peterson M. Computational approaches to stochastic vehicle routing problems. Transportation Sci. (1995) 29(4):342–352Link, Google Scholar
• Bertsimas D. J., Jaillet P., Odoni A. R. A priori optimization. Oper. Res. (1990) 38(6):1019–1033Link, Google Scholar
• Bertsimas D. J., Simchi-Levi D. A new generation of vehicle routing research: Robust algorithms, addressing uncertainty. Oper. Res. (1996) 44(2):286–304Link, Google Scholar
• Birge J. R., Louveaux F. V.An Introduction to Stochastic Programming (1997) (Springer-Verlag, New York) Google Scholar
• De Decker B., Louveaux F. V., Mortier C., Schepens G., Van Looveren A.Linear and Integer Programming with OMP (1987) (Beyers & Partners, Brasschaat, Belgium) Google Scholar
• Dror M. Modeling vehicle routing with uncertain demands as a stochastic program: Properties of the corresponding solution. Eur. J. Oper. Res. (1993) 64:432–441Crossref, Google Scholar
• Dror M., Laporte G., Trudeau P. Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Sci. (1989) 23(3):166–176Link, Google Scholar
• Dror M., Trudeau P. Stochastic vehicle routing with modified savings algorithm. Eur. J. Oper. Res. (1986) 23:228–235Crossref, Google Scholar
• Fisher M. L. Optimal solution of vehicle routing problems using minimum k-trees. Oper. Res. (1994) 42(4):626–642Link, Google 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(2):143–155Link, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88:3–12Crossref, Google Scholar
• Golden B. L., Stewart W. R., Hogben D., Fife D. Vehicle routing with probabilistic demands. Computer Science and Statistics: Tenth Annual Symposium on the Interface (1978) (NBS Special Publication 503)Google Scholar
• Hjorring C., Holt J., Beasley J. E., Sharaiha Y. M. New optimality cuts for a singlevehicle stochastic routing problem. Combinatorial Optimization: Recent Advances in Theory and Practice, Ann. Oper. Res. (1999) 86(Baltzer, Amsterdam)569–584Google Scholar
• Laporte G., Louveaux F. V. The integer L-shaped method for stochastic integer programs with complete recourse. Oper. Res. Lett. (1993) 13:133–142Crossref, Google Scholar
• Laporte G., Louveaux F. V., Crainic T. G., Laporte G. Solving stochastic routing problems with the integer L-shaped method. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 159–167Crossref, Google Scholar
• Laporte G., Nobert Y., Desrochers M. Optimal routing under capacity and demand restrictions. Oper. Res. (1985) 33:1050–1073Link, Google Scholar
• Louveaux F. V., Labbé M., Laporte G., Tanczos K., Toint P. An introduction to stochastic transportation models. Operations Research and Decision Aid Methodologies in Traffic and Transportation Management (1998) 166(Springer-Verlag, Berlin and Heidelberg) 244–263NATO ASI Series, Series F: Computer and Systems SciencesCrossref, Google Scholar
• Padberg M. W., Grötschel M., Lawler E. L., Lenstra J. K., Rinnooy Kan A. H. G., Shmoys D. B. Polyhedral computations. The Traveling Salesman Problem (1985) (Wiley, Chichester, U.K.) 307–360Google Scholar
• Padberg M. W., Rinaldi G. Facet identification for the symmetric traveling salesman problem. Math. Programming (1990) 47:219–257Crossref, Google Scholar
• Secomandi N. Exact and heuristic dynamic programming algorithms for the vehicle routing problem with stochastic demands. (1998) (Faculty of the College of Business Administration, University ofHouston, Houston, TX) . Ph.D. dissertationGoogle Scholar
• Teodorović D., Pavković G. A simulated annealing technique approach to the vehicle routing problem in case of stochastic Demand. Transportation Planning Tech. (1992) 6:261–273Crossref, Google Scholar
• Toth P., Vigo D., Crainic T. G., Laporte G. Exact solution of the vehicle routing problem. Fleet Management and Logistics (1998) (Kluwer, Boston, MA) 1–31Crossref, Google Scholar
• Yang W. H., Mathur K., Ballou R. H. Stochastic vehicle routing with restocking. Transportation Sci. (2000) 34(1):99–112Link, Google Scholar