Surveillance applications require a collection of heterogeneous vehicles to visit a set of targets. In this article, we consider a fundamental routing problem that arises in these applications involving two vehicles. Specifically, we consider a routing problem where there are two heterogeneous vehicles that start from distinct initial locations, and a set of targets. The objective is to find a tour for each vehicle such that each of the targets is visited at least once by a vehicle and the sum of the distances traveled by the vehicles is a minimum. We present a novel primal-dual algorithm for the same that provides an approximation ratio of 2.
- Dynamic Systems and Control Division
An Approximation Algorithm for a Heterogeneous Traveling Salesman Problem
- Views Icon Views
- Share Icon Share
- Search Site
Bae, J, & Rathinam, S. "An Approximation Algorithm for a Heterogeneous Traveling Salesman Problem." Proceedings of the ASME 2011 Dynamic Systems and Control Conference and Bath/ASME Symposium on Fluid Power and Motion Control. ASME 2011 Dynamic Systems and Control Conference and Bath/ASME Symposium on Fluid Power and Motion Control, Volume 1. Arlington, Virginia, USA. October 31–November 2, 2011. pp. 637-644. ASME. https://doi.org/10.1115/DSCC2011-6098
Download citation file: