[go: up one dir, main page]
IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-48439-2_26.html
   My bibliography  Save this book chapter

Solving the Multiple Traveling Salesperson Problem on Regular Grids in Linear Time

In: Operations Research Proceedings 2019

Author

Listed:
  • Philipp Hungerländer

    (University of Klagenfurt)

  • Anna Jellen

    (University of Klagenfurt)

  • Stefan Jessenitschnig

    (University of Klagenfurt)

  • Lisa Knoblinger

    (University of Klagenfurt)

  • Manuel Lackenbucher

    (University of Klagenfurt)

  • Kerstin Maier

    (University of Klagenfurt)

Abstract
In this work we analyze the multiple Traveling Salesperson Problem (mTSP) on regular grids. While the general mTSP is known to be NP-hard, the special structure of regular grids can be exploited to explicitly determine optimal solutions in linear time. Our research is motivated by several real-world applications, for example delivering goods with swarms of unmanned aerial vehicles (UAV) or search and rescue operations. In order to obtain regular grid structures, we divide large search areas in several equal-sized squares, where we choose the square size as large as the sensor range of a UAV. First, we use an Integer Linear Program (ILP) to formally describe our considered mTSP variant on regular grids that aims to minimize the total tour length of all salespersons, which corresponds to minimizing the average search time for a missing person. With the help of combinatorial counting arguments and the establishment of explicit construction schemes, we are able to determine optimal mTSP solutions for specific grid sizes with two salespersons, where the depot is located in one of the four corners.

Suggested Citation

  • Philipp Hungerländer & Anna Jellen & Stefan Jessenitschnig & Lisa Knoblinger & Manuel Lackenbucher & Kerstin Maier, 2020. "Solving the Multiple Traveling Salesperson Problem on Regular Grids in Linear Time," Operations Research Proceedings, in: Janis S. Neufeld & Udo Buscher & Rainer Lasch & Dominik Möst & Jörn Schönberger (ed.), Operations Research Proceedings 2019, pages 215-221, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-48439-2_26
    DOI: 10.1007/978-3-030-48439-2_26
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:oprchp:978-3-030-48439-2_26. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.