Document Type
Article
Publication Date
2020
Department
Department of Mechanical Engineering-Engineering Mechanics
Abstract
We study a Multiple Depot Heterogeneous Traveling Salesman Problem (MDHTSP) where the cost of the traveling between any two targets depends on the type of the vehicle. The travel costs are assumed to be symmetric, satisfy the triangle inequality, and are monotonic, i.e., the travel costs between any two targets monotonically increases with the index of the vehicles. Exploiting the monotonic structure of the travel costs, we present a 2-approximation algorithm based on the primal-dual method.
Publication Title
DROPS - Dagstuhl Research Online Publication Server
Recommended Citation
Rathinam, S.,
Ravi, R.,
Bae, J.,
&
Sundar, K.
(2020).
Primal-dual 2-approximation algorithm for the monotonic multiple depot heterogeneous traveling salesman problem.
DROPS - Dagstuhl Research Online Publication Server.
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/2592
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.
Version
Publisher's PDF
Publisher's Statement
© S. Rathinam, R. Ravi, J. Bae, and K. Sundar; licensed under Creative Commons License CC-BY 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Publisher’s version of record: https://doi.org/10.4230/LIPIcs.SWAT.2020.33