Xu, Dan

Weise, Thomas

Wu, Yuezhong

Lässig, Jörg

Chiong, Raymond

2015

<p>The Traveling Salesman Problem (TSP) is one of the most well-known problems in combinatorial optimization. Due to its -hardness, research has focused on approximate methods like metaheuristics. Tabu Search (TS) is a very efficient metaheuristic for combinatorial problems. We investigate four different versions of TS with different tabu objects and compare them to the Lin-Kernighan (LK) heuristic as well as the recently developed Multi-Neighborhood Search (MNS). LK is currently considered to be the best approach for solving the TSP, while MNS has shown to be highly competitive. We then propose new hybrid algorithms by hybridizing TS with Evolutionary Algorithms and Ant Colony Optimization. These hybrids are compared to similar hybrids based on LK and MNS. This paper presents the first statistically sound and comprehensive comparison taking the entire optimization processes of (hybrid) TS, LK, and MNS into consideration based on a large-scale experimental study. We show that our new hybrid TS algorithms are highly efficient and comparable to the state-of-the-art algorithms along this line of research.</p>

Bio-Inspired Computing -- Theories and Applications, 10th International Conference, BIC-TA 2015 Hefei, China, September 25-28, 2015, Proceedings, v.562, p. 523-537

9783662490143

9783662490136

https://hdl.handle.net/1959.11/61477

en

Springer-Verlag

Communications in Computer and Information Science

An investigation of hybrid Tabu search for the traveling salesman problem

Conference Publication

Publication