A transformation for a heterogeneous, 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 2
Cited 4

The vehicle routing problem

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

Operations Research Letters

The Traveling Salesman Problem with flexible coloring

Discrete Applied Mathematics
A novel two-level hybrid algorithm for multiple traveling salesman problems

ICSI'12 Proceedings of the Third international conference on Advances in Swarm Intelligence - Volume Part I
Evolutionary algorithm for the k-interconnected multi-depot multi-traveling salesmen problem

Proceedings of the 15th annual conference on Genetic and evolutionary computation
coRide: carpool service with a win-win fare model for large-scale taxicab networks

Proceedings of the 11th ACM Conference on Embedded Networked Sensor Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Unmanned aerial vehicles (UAVs) are being increasingly used for surveillance missions in civil and military applications. These vehicles can be heterogeneous in the sense that they can differ either in their motion constraints or sensing/attack capabilities. Given a surveillance mission that require a group of heterogeneous UAVs to visit a set of targets, this paper addresses a resource allocation problem of finding the optimal sequence of targets for each vehicle such that 1) each target is visited at least once by some vehicle, and 2) the total cost travelled by all the vehicles is minimized. This problem can be posed as a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem (HMDMTSP). This paper presents a transformation of a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem (HMDMTSP) into a single, Asymmetric, Traveling Salesman Problem (ATSP). As a result, algorithms available for the single salesman problem can be used to solve the HMDMTSP. To show the effectiveness of the transformation, the well known Lin-Kernighan-Helsgaun heuristic was applied to the transformed ATSP. Computational results show that good quality solutions can be obtained for the HMDMTSP relatively fast.