Abstract
We give the first probabilistic analysis of the Multiple Depot Vehicle Routing Problem(MDVRP) where we are given k depots and n customers in [0,1]2. The optimization problem is to find a collection of disjoint TSP tours with minimum total length such that all customers are served and each tour contains exactly one depot(not all depots have to be used). In the random setting the depots as well as the customers are given by independently and uniformly distributed random variables in [0,1]2. We show that the asymptotic tour length is \(\alpha_{k} \sqrt{n}\) for some constant α k depending on the number of depots. If k=o(n), α k is the constant α(TSP) of the TSP problem. Beardwood, Halton, and Hammersley(1959) showed 0.62≤ α(TSP)≤ 0.93. For k=λn, λ> 0, one expects that with increasing λ the MDVRP tour length decreases. We prove that this is true exhibiting lower and upper bounds on α k , which decay as fast as \((1+\lambda)^{-\frac{1}{2}}\).
A heuristics which first clusters customers around the nearest depot and then does the TSP routing is shown to find an optimal tour almost surely.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Arora, S.: Polynomial time Approximation Schemes for Euclidean TSP and other Geometric problems. J. ACM 45(5), 753–782 (1998)
Avram, F., Bertsimas, D.: On Central Limit Theorems in Geometrical Probability. The Annals of Applied Probability 3(4), 1033–1046 (1993)
Beardwood, J., Halton, J.H., Hammersley, J.M.: The shortest path through many points. In: Proc. Cambridge Philos. Soc. 55, pp. 299–327 (1959)
Chao, M., Golden, B.L., Wasil, E.: A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. American Journal of Mathematical and Management Sciences 13, 371–406 (1993)
Cordeau, J.F., Gendreau, M., Laporte, G.: A Tabu Search Heuristic for Periodic and Multi-Depot Vehicle Routing Problems. Networks 30, 105–119 (1997)
Fisher, M.L., Jaikumar, R.: A Generalized Assignment Heuristic for Vehicle Routing. Networks 11, 109–124 (1981)
Giosa, D., Tansini, L., Viera, O.: New Assignment Algorithms for the Multi-Depot Vehicle Routing Problem. Journal of the Operational Research Society 53(9), 977–984 (2002)
Karp, R.: Probabilistic Analysis of Partitioning Algorithms for the Travelling Salesman Problem in the Plane. Math. of Operations Research 2 (1977)
Karp, R., Steele, J.M.: Probabilistic Analysis of Heuristics. In: Lenstra, et al. (eds.) The Travelling Salesman Problem, John Wiley, Chichester (1985)
Lenstra, J., Rinnooy Kan, A.: Complexity of vehicle routing and scheduling problems. Networks 11, 221–227 (1981)
Penrose, M., Yukich, J.: Central Limit Theorems for some Graphs in Computational Geometry. Annals of Applied Prob. 11(4), 1005–1041 (2001)
Redmond, C., Yukich, J.E.: Limit theorems and rates of convergence for Euclidean functionals. Ann. Appl. Probab. 4(4), 1057–1073 (1994)
Renaud, J., Laporte, G., Boctor, F.F.: A tabu search heuristic for the multidepot vehicle routing problem. Computers and Operations Research 23, 229–235 (1996)
Rhee, W.T.: A matching problem and subadditive Euclidean functionals. Ann. Appl. Probab. 3(3), 794–801 (1993)
Steele, J.M.: Probability theory and combinatorial optimization. In: Society for Industrial and Applied Mathematics (SIAM), Philadelphia, PA. CBMS-NSF Regional Conference Series, vol. 69 (1997)
Tansini, L.: Ph.D Thesis (to appear)
Yukich, J.E.: Probability theory of classical Euclidean optimization problems. Lecture Notes in Mathematics, vol. 1675. Springer, Berlin (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baltz, A., Dubhashi, D., Tansini, L., Srivastav, A., Werth, S. (2005). Probabilistic Analysis for a Multiple Depot Vehicle Routing Problem. In: Sarukkai, S., Sen, S. (eds) FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science. FSTTCS 2005. Lecture Notes in Computer Science, vol 3821. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11590156_29
Download citation
DOI: https://doi.org/10.1007/11590156_29
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30495-1
Online ISBN: 978-3-540-32419-5
eBook Packages: Computer ScienceComputer Science (R0)