Analysis of neighborhood generation and move selection strategies on the performance of tabu search
Farhad Kolahan, Ahmad Tavakoli, Behrang Tajdin, Modjtaba Hosayni · 2006
In recent years, heuristic algorithms are widely used to solve very large and complicated optimization problems. In this paper, the structure of Tabu Search (TS) - one of the most efficient neighborhood search algorithms - is fist explained. Then the effect of several neighborhood generation and move selection mechanisms on its performance is investigated. To reach this goal, a set of constrained Traveling Salesman Problems (TSP) is solved by five different neighborhoods. The performance of TS algorithm is then evaluated and compared from the view point of convergence speed and solutions qualities.