Technical Note—Approximation Algorithms for VRP with Stochastic Demands

References

• Altinkemer K., Gavish B. Heuristics for unequal weight delivery problems with a fixed error guarantee. Oper. Res. Lett. (1987) 6(4):149–158Crossref, Google Scholar
• Altinkemer K., Gavish B. Heuristics for delivery problems with constant error guarantees. Transportation Res. (1990) 24(4):294–297Abstract, Google Scholar
• Arora S. Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J. ACM (1998) 45(5):753–782Crossref, Google Scholar
• Bertsimas D. J. A vehicle routing problem with stochastic demand. Oper. Res. (1992) 40(3):574–585Link, 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
• Bompadre A., Dror M., Orlin J. B. Improved bounds for vehicle routing solutions. Discrete Optim. (2006) 3(4):299–316Crossref, Google Scholar
• Bompadre A., Dror M., Orlin J. B. Probabilistic analysis of unit-demand VRP. J. Appl. Probab. (2007) 44:259–278Crossref, Google Scholar
• Christofides N. Worst-case analysis of a new heuristic for the travelling salesman problem. (1977) . GSIA, CMU-Report 388, Carnegie Mellon University, PittsburghGoogle Scholar
• Das A., Mathieu C. A quasi-polynomial time approximation scheme for Euclidean capacitated vehicle routing. Proc. Symp. Discrete Algorithms (2010) (ACM-SIAM, Philadelphia) Crossref, Google Scholar
• Dror M., Dror M., L'Ecuyer P., Szidarouszky F. Vehicle routing with stochastic demands: Models and computational methods. Modeling Uncertainty: An Examination of Stochastic Theory, Methods, and Applications (2002) 46(Kluwer Academic Publishers, Dordrecht, The Netherlands) 625–649Crossref, Google Scholar
• Gendreau M., Laporte G., Séguin R. Stochastic vehicle routing. Eur. J. Oper. Res. (1996) 88(1):3–12Crossref, Google Scholar
• Haimovich M., Rinnooy Kan A. H. G. Bounds and heuristics for capacitated routing problems. Math. Oper. Res. (1985) 10(4):527–542Link, Google Scholar
• Mitchell J. S. B. Guillotine subdivisions approximate polygonal subdivisions: Part II—A simple polynomial-time approximation scheme for geometric TSP, k-MST, and related problems. SIAM J. Comput. (1999) 28(4):1298–1309Crossref, Google Scholar
• Powell W. B., Jaillet P., Odoni A., Ball M. O., Magnanti T. L., Monma C. L., Nemhauser G. L. Stochastic and dynamic networks and routing. Network Routing (1995) 8(Elsevier Science BV, Amsterdam) 141–295Handbooks in Operations Research and Management ScienceCrossref, Google Scholar
• Stewart W., Golden B. Stochastic vehicle routing: A comprehensive approach. Eur. J. Oper. Res. (1983) 14(4):371–385Crossref, Google Scholar