Probabilistic analysis for a multiple depot vehicle routing problem

Random Structures and Algorithms

Volumn 30, Issue 1-2, 2007, Pages 206-225

  Baltz, Andreas ^a   Dubhashi, Devdatt ^b   Srivastav, Anand ^a   Tansini, Libertad ^b   Werth, Sören ^a  

^a UNIVERSITY OF KIEL   (Germany)

^b CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

MDVRP; Probabilistic analysis; Vehicle routing

Indexed keywords

EID: 33846696534     PISSN: 10429832     EISSN: 10982418     Source Type: Journal    
DOI: 10.1002/rsa.20156     Document Type: Conference Paper

References (29)

1. S. Arora, Polynomial time approximation schemes for euclidean TSP and other geometric problems, J ACM 45 (1998), 753-782.
2. F. Avram and D. Bertsimas, On central limit theorems in geometrical probability, Ann Appl Probab 3 (1993), 1033-1046.
3. J. Beardwood, J. H. Halton, and J. M. Hammersley, The shortest path through many points, In Proc Cambridge Philos Soc 55 (1959), 299-327.
4. D. Bertsimas and G. van Ryzin, An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability, Oper Res Lett 9 (1990), 223-231.
5. A. Bompadre, M. Dror, and J. B. Orlin, Probabilistic analysis of unit demand vehicle rounting problems, J Appl Probab, to appear.
6. I. M. Chao, B. L. Golden, and E. Wasil, A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions, Am J Mgmt Sci 13 (1993), 371-406.
7. J. F. Cordeau, M. Gendreau, and G. Lapone, A tabu search heuristic for periodic and multi-depot vehicle routing problems, Networks 30 (1997), 105-119.
8. M. L. Fisher and R. Jaikumar, A generalized assignment heuristic for vehicle routing, Networks 11 (1981), 109-124.
9. A. Frieze and J. E. Yukich, Probabilistic analysis of the traveling salesman problem, In Eds. G. Gutin and A. P. Punnen, The traveling salesman problem and its variations, Kluwer Academic Publisher, 2002, pp. 257-308.
10. D. Giosa, L. Tansini, and O. Viera, New assignment algorithms for the multi-depot vehicle routing problem, J Oper Res Soc 53 (2002), 977-984.
11. M. Haimovich and A. Rinnooy Kan, Bounds and heuristics for capacitated routing problems, Math Oper Res 10 (1985), 527-542.
12. J. L. Jacobsen, N. Read, and H. Saleur, The traveling salesman problem, conformal invariance, and dense polymers, Phys Rev Lett 93 (2004), 038701.
13. J. Lenstra and A. Rinnooy Kan, Complexity of vehicle routing and scheduling problems, Networks 11 (1981), 221-227.
14. C. Li and D. Simchi-Levi, Worst-case analysis of heuristics for the multi-depot capacitated vehicle routing problems, ORSA J Comput 2 (1990), 64-73.
15. K. McGivney and J. E. Yukich, Asymptotics for Voronoi tessellations on random samples, Stochastic Processes Applic 83 (1999), 273-288.
16. C. H. Papdimitriou, The probabilisitic analysis of matching heuristics, Proceedings of the 15th Allerton Conference on Communication, Control, and Computing, 1978, pp. 368-378.
17. M. Penrose and J. Yukich, Central limit theorems for some graphs in computational geometry, Ann Appl Probab 11 (2001), 1005-1041.
18. C. Redmond and J. E. Yukich, Limit theorems and rates of convergence for Euclidean functionals, Ann Appl Probab 4 (1994), 1057-1073.
19. J. Renaud, G. Laporte, and F. F. Boctor, A tabu search heuristic for the multi-depot vehicle routing problem, Comp Oper Res 23 (1996), 229-235.
20. W. T. Rhee, On the traveling salesperson problem in many dimensions, Random Struct Algor 3 (1992), 227-233.
21. W. T. Rhee, A matching problem and subadditive Euclidean functionals, Ann Appl Probab 3 (1993), 794-801.
22. W. T. Rhee, Probabilistic analysis of a capacitated vehicle routing problem, Optimization 27 (1993), 79-87.
23. W. T. Rhee, Probabilistic analysis of a capacitated vehicle routing problem-II, Ann Appl Probab 4 (1994), 741-764.
24. I. M. Steele, Subadditive Euclidean functionals and non-linear growth in geometric probability, Ann Prob 9 (1981), 365-376.
25. J. M. Steele, Probability theory and combinatorial optimization, In CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 69. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA, 1997.
26. L. Tansini, PhD Thesis, Department of Computing Science, Chalmers University, Göteborg, Sweden, to appear.
27. B. Weide, Statistical methods in algorithm design and analysis, PhD Thesis, computer Science Department, Carnegie Mellon University, 1978.
28. S. Werth, Doctoral dissertation, Department of Computing Science, Christian-Albrechts-Universität zu Kiel, Germany, 2006.
29. J. E. Yukich, Probability theory of classical Euclidean optimization problems, In Lecture notes in Mathematics, Vol. 1675. Springer-Verlag, Berlin, 1998.