A Transformation for a Heterogeneous, Multiple Depot, Multiple Traveling Salesman Problem

被引:45
|
作者
Oberlin, Paul [1 ]
Rathinam, Sivakumar [1 ]
Darbha, Swaroop [1 ]
机构
[1] Texas A&M Univ, Dept Mech Engn, College Stn, TX 77843 USA
关键词
Unmanned Aerial Vehicle; Heterogeneous Multiple Traveling Salesman Problem; Vehicle Routing; ALGORITHM;
D O I
10.1109/ACC.2009.5160666
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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-Heisgaun heuristic was applied to the transformed ATSP. Computational results show that good quality solutions can be obtained for the HMDMTSP relatively fast.
引用
收藏
页码:1292 / 1297
页数:6
相关论文
共 50 条
  • [1] A Transformation for a Multiple Depot, Multiple Traveling Salesman Problem
    Oberlin, Paul
    Rathinam, Sivakumar
    Darbha, Swaroop
    [J]. 2009 AMERICAN CONTROL CONFERENCE, VOLS 1-9, 2009, : 2636 - 2641
  • [2] A Transformation for Multiple Depot Multiple Traveling Salesman Problem
    Assaf, Mustafa
    Ndiaye, Malick
    [J]. 2017 INTERNATIONAL CONFERENCE ON ENGINEERING & MIS (ICEMIS), 2017,
  • [3] An exact algorithm for a heterogeneous, multiple depot, multiple traveling salesman problem
    Sundar, Kaarthik
    Rathinam, Sivakumar
    [J]. 2015 INTERNATIONAL CONFERENCE ON UNMANNED AIRCRAFT SYSTEMS (ICUAS'15), 2015, : 366 - 371
  • [4] Solving an Open Path Multiple Depot Multiple Traveling Salesman Problem after transformation
    Assaf, Mustafa
    Ndiaye, Malick
    [J]. 2017 7TH INTERNATIONAL CONFERENCE ON MODELING, SIMULATION, AND APPLIED OPTIMIZATION (ICMSAO), 2017,
  • [5] Solving Heterogeneous Fleet Multiple Depot Vehicle Scheduling Problem as an Asymmetric Traveling Salesman Problem
    Ramos, Jorge Alpedrinha
    Reis, Luis Paulo
    Pedrosa, Dulce
    [J]. PROGRESS IN ARTIFICIAL INTELLIGENCE-BOOK, 2011, 7026 : 98 - +
  • [6] A 3/2-Approximation Algorithm for Multiple Depot Multiple Traveling Salesman Problem
    Xu, Zhou
    Rodrigues, Brian
    [J]. ALGORITHM THEORY - SWAT 2010, PROCEEDINGS, 2010, 6139 : 127 - +
  • [7] AN IMPROVED TRANSFORMATION OF THE SYMMETRIC MULTIPLE TRAVELING SALESMAN PROBLEM
    JONKER, R
    VOLGENANT, T
    [J]. OPERATIONS RESEARCH, 1988, 36 (01) : 163 - 167
  • [8] A Hierarchical Framework for Solving the Constrained Multiple Depot Traveling Salesman Problem
    Yang, Ruixiao
    Fan, Chuchu
    [J]. IEEE ROBOTICS AND AUTOMATION LETTERS, 2024, 9 (06) : 5536 - 5543
  • [9] A SIMPLE ALGORITHM FOR THE MULTI-DEPOT MULTIPLE TRAVELING SALESMAN PROBLEM
    Nuriyev, Urfat
    Ugurlu, Onur
    Nuriyeva, Fidan
    [J]. PROCEEDINGS OF THE 6TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL II, 2018, : 235 - 237
  • [10] A Lagrangian Algorithm for Multiple Depot Traveling Salesman Problem With Revisit Period Constraints
    Scott, Drew
    Manyam, Satyanarayana Gupta
    Casbeer, David W.
    Kumar, Manish
    [J]. IEEE TRANSACTIONS ON AUTOMATION SCIENCE AND ENGINEERING, 2023, 20 (01) : 690 - 702