Swarm double-tabu search

  • Authors:

  • Wanhui Wen;Guangyuan Liu

  • Affiliations:

  • School of Electronic & Information Engineering, Southwest China Normal University, Chongqing, People's Republic of China;School of Electronic & Information Engineering, Southwest China Normal University, Chongqing, People's Republic of China

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this work, a new heuristic algorithm, named Swarm Double-Tabu Search (SDTS), has been proposed. SDTS attempts to solve the problems of NP-hard combinatorial optimization effectively and efficiently. The particle swarm and the double-tabu strategies adopted in the SDTS algorithm have got excellent search result. Simulations on Traveling Salesman Problem (TSP) were performed, and the results compared to those obtained by neural network approaches were optimal or near optimal.