An analysis of the extended Christofides heuristic for the k-depot TSP

Authors:
Zhou Xu;Liang Xu;Brian Rodrigues
Affiliations:
Department of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Hong Kong;Department of Logistics and Maritime Studies, Faculty of Business, The Hong Kong Polytechnic University, Hung Hom, Hong Kong;Lee Kong Chian School of Business, Singapore Management University, Singapore
Venue:
Operations Research Letters
Year:
2011

Citing 6
Cited 0

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
Combinatorial Optimization: Theory and Algorithms

Combinatorial Optimization: Theory and Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study an extension of the classical traveling salesman problem (TSP) to a situation with k=2 depots at each of which a distinct salesman is based. We show that a non-trivial extension of the well-known Christofides heuristic has a tight approximation ratio of 2-1/k, which improves on the known 2-approximation algorithm from the literature.