Analysis of neighborhood generation and move selection strategies on the performance of tabu search

Authors:
Farhad Kolahan;Ahmad Tavakoli;Behrang Tajdin;Modjtaba Hosayni
Affiliations:
Mechanical Engineering Department, Ferdowsi University of Mashhad, Iran;Department of Management, Ferdowsi University of Mashhad, Iran;Ferdowsi University of Mashhad, Iran;Ferdowsi University of Mashhad, Iran
Venue:
ACS'06 Proceedings of the 6th WSEAS international conference on Applied computer science
Year:
2006

Citing 3
Cited 0

Simulated annealing and tabu search: lessons from a line search

Computers and Operations Research - Special issue: heuristic, genetic and tabu search
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem

Mathematical and Computer Modelling: An International Journal
The multiple depot, multiple traveling salesmen facility-location problem: Vehicle range, service frequency, and heuristic implementations

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.