Department of Mechanical Engineering-Engineering Mechanics
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.
Leibniz International Proceedings in Informatics, LIPIcs
Primal-dual 2-approximation algorithm for the monotonic multiple depot heterogeneous traveling salesman problem.
Leibniz International Proceedings in Informatics, LIPIcs,
Retrieved from: https://digitalcommons.mtu.edu/michigantech-p/14438
Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.