A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
As an important extension of the classical traveling salesman problem (TSP), the multiple depot multiple traveling salesman problem (MDMTSP) is to minimize the total length of a collection of tours for multiple vehicles to serve all the customers, where each vehicle must start or stay at its distinct depot. Due to the gap between the existing best approximation ratios for the TSP and for the MDMTSP in literature, which are 3/2 and 2, respectively, it is an open question whether or not a 3/2-approximation algorithm exists for the MDMTSP. We have partially addressed this question by developing a 3/2-approximation algorithm, which runs in polynomial time when the number of depots is a constant.
KeywordsApproximation algorithm multiple depots vehicle routing
Unable to display preview. Download preview PDF.
- 2.Christofides, N.: Worst-case analysis of a new heuristic for the travelling salesman problem, Technical Report 388, Graduate School of Industrial Administration, Carnegie-Mellon University (1976)Google Scholar
- 9.Papadimitriou, C.H., Steiglitz, K.: Approximation algorithms for the traveling salesman problem. In: Combinatorial Optimization: Algorithms and Complexity, pp. 410–419. Courier Dover Publications (1998)Google Scholar
- 10.Rathinam, S., Sengupta, R.: 3/2-Approximation Algorithm for a Generalized, Multiple Depot, Hamiltonina Path Problem. Technical report, University of California, Berkeley (2007)Google Scholar
- 11.Rathinam, S., Sengupta, R.: 5/3-approximation algorithm for a multiple depot, terminal hamiltonian path problem. Technical report, University of California, Berkeley (2007)Google Scholar
- 16.Wolsey, L.A., Nemhauser, G.L.: Integer and Combinatorial Optimization, ch. section III.3, p. 664. Wiley-Interscience, Hoboken (1988)Google Scholar