A Hybrid Metaheuristic for the Clustered Travelling Salesman Problem

Abtin Nourmohammadzadeh () and Stefan Voß ()
Additional contact information
Abtin Nourmohammadzadeh: Institute of Information Systems, University of Hamburg
Stefan Voß: Institute of Information Systems, University of Hamburg

Chapter Chapter 46 in Operations Research Proceedings 2022, 2023, pp 385-392 from Springer

Abstract: 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.

Keywords: Clustered travelling salesman problem; Hybrid metaheuristic; Artificial bee colony algorithm; Tabu search (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnopch:978-3-031-24907-5_46

Ordering information: This item can be ordered from
http://www.springer.com/9783031249075

DOI: 10.1007/978-3-031-24907-5_46

Access Statistics for this chapter

More chapters in Lecture Notes in Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().