IDEAS home Printed from https://ideas.repec.org/h/spr/lnopch/978-3-031-24907-5_46.html
   My bibliography  Save this book chapter

A Hybrid Metaheuristic for the Clustered Travelling Salesman Problem

In: Operations Research Proceedings 2022

Author

Listed:
  • Abtin Nourmohammadzadeh

    (Institute of Information Systems, University of Hamburg)

  • Stefan Voß

    (Institute of Information Systems, University of Hamburg)

Abstract

In this work, a special type of the travelling salesman problem (TSP), namely the clustered TSP (CTSP), is addressed. In the CTSP, the cities are already divided into clusters and the salesman seeks to find the shortest tour through all the cities which includes each city exactly once while being restricted to visit the cities of each cluster contiguously. Due to the NP-hardness of the focused problem, a hybrid metaheuristic consisting of the artificial bee colony (ABC) and the tabu search (TS) algorithm is proposed to deal with it. The results of our solution approach on two sets of benchmark instances are presented and compared with those of two other methods from the literature.

Suggested Citation

  • Abtin Nourmohammadzadeh & Stefan Voß, 2023. "A Hybrid Metaheuristic for the Clustered Travelling Salesman Problem," Lecture Notes in Operations Research, in: Oliver Grothe & Stefan Nickel & Steffen Rebennack & Oliver Stein (ed.), Operations Research Proceedings 2022, chapter 0, pages 385-392, Springer.
    • Handle: RePEc:spr:lnopch:978-3-031-24907-5_46
    DOI: 10.1007/978-3-031-24907-5_46
    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:lnopch:978-3-031-24907-5_46. 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.