Tabu search algorithm based on insertion method

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.