Dynamic tabu list management using the reverse elimination method

Dynamic tabu list management using the reverse elimination method

0.00 Avg rating0 Votes
Article ID: iaor19932334
Country: Switzerland
Volume: 41
Issue: 1/4
Start Page Number: 31
End Page Number: 46
Publication Date: May 1993
Journal: Annals of Operations Research
Authors: ,
Keywords: tabu search
Abstract:

Tabu search is a metastrategy for guiding known heuristics to overcome local optimality. Successful applications of this kind of metaheuristic to a great variety of problems have been reported in the literature. However, up to now mainly static tabu list management ideas have been applied. In this paper the authors describe a dynamic strategy, the reverse elimination method, and give directions on improving its computational effort. The impact of the method will be shown with respect to a multiconstraint version of the zero-one knapsack problem. Numerical results are presented comparing it with a simulated annealing approach.

Reviews

Required fields are marked *. Your email address will not be published.