Abstract
Metaheuristics have been widely used to solve NP-hard problems, with excellent results. Among all NP-hard problems, the Travelling Salesman Problem (TSP) is potentially the most studied one. In this work, a variation of the TSP is considered; the main differences being, edges may have positive or negative costs and the objective is to return a Hamiltonian cycle with cost as close as possible to zero. This variation is called the balanced TSP (BTSP). To tackle this new problem, we present an adaptive variant of the iterated local search metaheuristic featuring also random restart. This algorithm was tested on the MESS2018 metaheuristic competition and achieved notable results, scoring the 5th position overall. In this paper, we detail all the components of the algorithm itself and present the best solutions identified. Even though this metaheuristic was tailored for the BTSP, with small modifications its structure can be applied to virtually any NP-hard problem. In particular, we introduce the uneven reward-and-punishment rule which is a powerful tool, applicable in many contexts where fast responses to dynamic changes are crucial.
Original language | English |
---|---|
Title of host publication | Metaheuristics for Combinatorial Optimization |
Editors | Salvatore Greco, Mario F. Pavone, El-Ghazali Talbi, Daniele Vigo |
Place of Publication | Cham |
Publisher | Springer |
Pages | 37-56 |
Number of pages | 20 |
ISBN (Electronic) | 978-3-030-68520-1 |
ISBN (Print) | 978-3-030-68519-5 |
DOIs | |
Publication status | Published - 2021 |
Event | Metaheuristics Summer School, MESS 2018 - Taormina, Italy Duration: 21 Jul 2018 → 25 Jul 2018 |
Publication series
Name | Advances in Intelligent Systems and Computing |
---|---|
Volume | 1332 |
ISSN (Print) | 2194-5357 |
ISSN (Electronic) | 2194-5365 |
Conference
Conference | Metaheuristics Summer School, MESS 2018 |
---|---|
Country/Territory | Italy |
City | Taormina |
Period | 21/07/18 → 25/07/18 |
Bibliographical note
Green Open Access added to TU Delft Institutional Repository ‘You share, we take care!’ – Taverne project https://www.openaccess.nl/en/you-share-we-take-careOtherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.
Keywords
- Balanced Travelling Salesman Problem
- Hamiltonian cycle
- Iterated Local Search
- Metaheuristic
- Travelling Salesman Problem