A 3/2-approximation algorithm for multiple depot multiple traveling salesman problem

Authors:
Zhou Xu;Brian Rodrigues
Affiliations:
Faculty of Business, The Hong Kong Polytechnic University;Lee Kong Chian School of Business, Singapore Management University
Venue:
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Year:
2010

Citing 6
Cited 1

Integer and combinatorial optimization

Integer and combinatorial optimization
A tabu search heuristic for the multi-depot vehicle routing problem

Computers and Operations Research
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Approximations for minimum and min-max vehicle routing problems

Journal of Algorithms
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

Operations Research Letters
32-approximation algorithm for two variants of a 2-depot Hamiltonian path problem

Operations Research Letters

Multi-Robot traveling problem constrained by connectivity

ICPCA/SWS'12 Proceedings of the 2012 international conference on Pervasive Computing and the Networked World

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.