A transformation for a multiple depot, multiple traveling salesman problem

Authors:
Paul Oberlin;Sivakumar Rathinam;Swaroop Darbha
Affiliations:
Department of Mechanical Engineering, Texas A & M University, College Station, Texas;Department of Mechanical Engineering, Texas A & M University, College Station, Texas;Department of Mechanical Engineering, Texas A & M University, College Station, Texas
Venue:
ACC'09 Proceedings of the 2009 conference on American Control Conference
Year:
2009

Citing 3
Cited 0

An improved transformation of the symmetric multiple traveling salesman problem

Operations Research
The vehicle routing problem

The vehicle routing problem
An approximation algorithm for a symmetric Generalized Multiple Depot, Multiple Travelling Salesman Problem

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, a Multiple Depot, Multiple Traveling Salesman Problem is transformed into a Single, Asymmetric Traveling Salesman Problem if the cost of the edges satisfy the triangle inequality. This improves on the previously known transformation for a 2-Depot, Multiple Traveling Salesman Problem in the literature. To test the effectiveness of the transformation, some computational results are presented by applying the well known LKH heuristic on the transformed problem for instances involving Dubins vehicles. Results show that the transformation is effective and high quality solutions can be found for large instances in a relatively short time.