Today's Traveling Salesman Problem

Abstract

Heterogeneous unmanned aerial vehicles (UAVs) are being developed for several civil and military applications. These vehicles can differ either in their motion constraints or sensing/attack capabilities. This article uses methods from operations research to address a fundamental routing problem involving heterogeneous UAVs. The approach is to transform the routing problem into a relatively better understood single, asymmetric, traveling salesman problem (ATSP) and use the algorithms available for the ATSP to address the routing problem. To test the effectiveness of the transformation, the well-known Lin-Kernighan-Helsgaun heuristic was applied to the transformed ATSP. Computational results on the transformed ATSP show that solutions whose costs are within 16% of the optimum can be obtained relatively fast [within 40 s of central processing unit (CPU)] for the routing problem involving ten heterogeneous UAVs and 40 targets.