A Transformation for a Multiple Depot, Multiple Traveling Salesman Problem Conference Paper

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. 2009 AACC.

name of conference

• 2009 American Control Conference

authors

• Darbha, Swaroop
• Rathinam, Sivakumar

published proceedings

• 2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9

altmetric score

• 0.5

author list (cited authors)

• Oberlin, P., Rathinam, S., & Darbha, S.

citation count

• 19

complete list of authors

• Oberlin, Paul||Rathinam, Sivakumar||Darbha, Swaroop

publication date

• January 2009

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• Proceedings of the ... American Control Conference. American Control Conference  Journal

keywords

• Multiple Depot Routing
• Traveling Salesman
• Unmanned Aerial Vehicle

Digital Object Identifier (DOI)

• 10.1109/ACC.2009.5160665

International Standard Book Number (ISBN) 13

• 978-1-4244-4523-3

start page

• 2636

end page

• 2641

URL

• http://dx.doi.org/10.1109/acc.2009.5160665