IDEAS home Printed from https://ideas.repec.org/a/spr/annopr/v259y2017i1d10.1007_s10479-017-2513-4.html
   My bibliography  Save this article

The multi-stripe travelling salesman problem

Author

Listed:
  • Eranda Çela

    (TU Graz)

  • Vladimir G. Deineko

    (The University of Warwick)

  • Gerhard J. Woeginger

    (Lehrstuhl für Informatik 1, RWTH Aachen)

Abstract

In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with $$q\ge 1$$ q ≥ 1 , the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic assignment problem. We analyze the computational complexity of the q-stripe TSP for various classes of specially structured distance matrices. We derive NP-hardness results as well as polynomially solvable cases. One of our main results generalizes a well-known theorem of Kalmanson from the classical TSP to the q-stripe TSP.

Suggested Citation

  • Eranda Çela & Vladimir G. Deineko & Gerhard J. Woeginger, 2017. "The multi-stripe travelling salesman problem," Annals of Operations Research, Springer, vol. 259(1), pages 21-34, December.
  • Handle: RePEc:spr:annopr:v:259:y:2017:i:1:d:10.1007_s10479-017-2513-4
    DOI: 10.1007/s10479-017-2513-4
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s10479-017-2513-4
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s10479-017-2513-4?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Sergey Polyakovskiy & Frits C. R. Spieksma & Gerhard J. Woeginger, 2013. "The three-dimensional matching problem in Kalmanson matrices," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 1-9, July.
    2. A. Kononov & S. Sevastianov & I. Tchernykh, 1999. "When difference in machine loads leadsto efficient scheduling in open shops," Annals of Operations Research, Springer, vol. 92(0), pages 211-239, January.
    3. E. Balas, 1999. "New classes of efficiently solvable generalized Traveling Salesman Problems," Annals of Operations Research, Springer, vol. 86(0), pages 529-558, January.
    4. Bettina Klinz & Gerhard J. Woeginger, 1999. "The Steiner Tree Problem in Kalmanson Matrices and in Circulant Matrices," Journal of Combinatorial Optimization, Springer, vol. 3(1), pages 51-58, July.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Çela, Eranda & Deineko, Vladimir & Woeginger, Gerhard J., 2018. "New special cases of the Quadratic Assignment Problem with diagonally structured coefficient matrices," European Journal of Operational Research, Elsevier, vol. 267(3), pages 818-834.
    2. Timo Hintsch, 2019. "Large Multiple Neighborhood Search for the Soft-Clustered Vehicle-Routing Problem," Working Papers 1904, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    3. Jayanth Krishna Mogali & Joris Kinable & Stephen F. Smith & Zachary B. Rubinstein, 2021. "Scheduling for multi-robot routing with blocking and enabling constraints," Journal of Scheduling, Springer, vol. 24(3), pages 291-318, June.
    4. Hintsch, Timo & Irnich, Stefan, 2018. "Large multiple neighborhood search for the clustered vehicle-routing problem," European Journal of Operational Research, Elsevier, vol. 270(1), pages 118-131.
    5. de Weerdt, Mathijs & Baart, Robert & He, Lei, 2021. "Single-machine scheduling with release times, deadlines, setup times, and rejection," European Journal of Operational Research, Elsevier, vol. 291(2), pages 629-639.
    6. Richard K. Congram & Chris N. Potts & Steef L. van de Velde, 2002. "An Iterated Dynasearch Algorithm for the Single-Machine Total Weighted Tardiness Scheduling Problem," INFORMS Journal on Computing, INFORMS, vol. 14(1), pages 52-67, February.
    7. Timo Hintsch & Stefan Irnich, 2017. "Large Multiple Neighborhood Search for the Clustered Vehicle-Routing Problem," Working Papers 1701, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    8. Andre A. Cire & Willem-Jan van Hoeve, 2013. "Multivalued Decision Diagrams for Sequencing Problems," Operations Research, INFORMS, vol. 61(6), pages 1411-1428, December.
    9. Nicola Secomandi & François Margot, 2009. "Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands," Operations Research, INFORMS, vol. 57(1), pages 214-230, February.
    10. Sergey Polyakovskiy & Frits C. R. Spieksma & Gerhard J. Woeginger, 2013. "The three-dimensional matching problem in Kalmanson matrices," Journal of Combinatorial Optimization, Springer, vol. 26(1), pages 1-9, July.
    11. Dominique Feillet & Pierre Dejax & Michel Gendreau, 2005. "Traveling Salesman Problems with Profits," Transportation Science, INFORMS, vol. 39(2), pages 188-205, May.
    12. Koulamas, Christos & Kyparisis, George J., 2015. "The three-machine proportionate open shop and mixed shop minimum makespan problems," European Journal of Operational Research, Elsevier, vol. 243(1), pages 70-74.
    13. Christian Tilk & Stefan Irnich, 2014. "Dynamic Programming for the Minimum Tour Duration Problem," Working Papers 1408, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz, revised 04 Aug 2014.
    14. Oleg L. Tashlykov & Alexander N. Sesekin & Alexander G. Chentsov & Alexei A. Chentsov, 2022. "Development of Methods for Route Optimization of Work in Inhomogeneous Radiation Fields to Minimize the Dose Load of Personnel," Energies, MDPI, vol. 15(13), pages 1-11, June.
    15. Egon Balas & Neil Simonetti, 2001. "Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study," INFORMS Journal on Computing, INFORMS, vol. 13(1), pages 56-75, February.
    16. Christian Tilk & Stefan Irnich, 2017. "Dynamic Programming for the Minimum Tour Duration Problem," Transportation Science, INFORMS, vol. 51(2), pages 549-565, May.
    17. Ahmadian, Mohammad Mahdi & Khatami, Mostafa & Salehipour, Amir & Cheng, T.C.E., 2021. "Four decades of research on the open-shop scheduling problem to minimize the makespan," European Journal of Operational Research, Elsevier, vol. 295(2), pages 399-426.
    18. Jeanette Schmidt & Stefan Irnich, 2020. "New Neighborhoods and an Iterated Local Search Algorithm for the Generalized Traveling Salesman Problem," Working Papers 2020, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    19. Vu, Duc Minh & Hewitt, Mike & Vu, Duc D., 2022. "Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery," European Journal of Operational Research, Elsevier, vol. 302(3), pages 831-846.

    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:annopr:v:259:y:2017:i:1:d:10.1007_s10479-017-2513-4. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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.