Title : ( Analysis of neighborhood generation and move selection strategies on the performance of Tabu Search )
Authors: Farhad Kolahan , Ahmad Tavakkoli , Behrang Tajdin , - - ,
Full TextAbstract
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.
Keywords
, Optimization algorithms, Tabu Search, neighborhood generation, move strategies, TSP
@inproceedings{paperid:1012723,
author = {Kolahan, Farhad and Tavakkoli, Ahmad and Tajdin, Behrang and -, -},
title = {Analysis of neighborhood generation and move selection strategies on the performance of Tabu Search},
booktitle = {6th WSEAS International Conference on Applied Computer Science},
year = {2006},
location = {tenerif-canary islands},
keywords = {Optimization algorithms; Tabu Search; neighborhood generation; move strategies; TSP},
}
%0 Conference Proceedings
%T Analysis of neighborhood generation and move selection strategies on the performance of Tabu Search
%A Kolahan, Farhad
%A Tavakkoli, Ahmad
%A Tajdin, Behrang
%A -, -
%J 6th WSEAS International Conference on Applied Computer Science
%D 2006
