Tabu search algorithm based on insertion method

Author

Fang, Yonghui ; Liu, Guangyuan ; He, Yi ; Qiu, Yuhui

Author_Institution

Sch. of Electron. Information Eng., Southwest China Normal Univ., Chongqing, China

Volume

1

fYear

2003

fDate

14-17 Dec. 2003

Firstpage

420

Abstract

This paper presents a tabu insertion search algorithm (TIS) based on the merits of insertion method (IM) and tabu search (TS) algorithm for solving travel salesman problem (TSP). TIS combines the good local search ability of tabu search with the good tour construct ability of insertion method to search the solution space and to solve the combinatorial optimization problem. In this paper, we use the classical NP hard problem TSP to test the effectiveness of TIS. Results show that TIS has the good ability to jump beyond local optimum and to obtain the global optimum.

Keywords

computational complexity; search problems; travelling salesman problems; NP hard problem; TSP; combinatorial optimization problem; insertion method; tabu insertion search algorithm; tabu search algorithm; travel salesman problem; Cities and towns; Cost function; Information management; Information science; NP-hard problem; Optimization methods; Optimized production technology; Space exploration; Space technology; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

Neural Networks and Signal Processing, 2003. Proceedings of the 2003 International Conference on

Conference_Location

Nanjing

Print_ISBN

0-7803-7702-8

Type

conf

DOI

10.1109/ICNNSP.2003.1279298

Filename

1279298