Diversification strategies in tabu search algorithms for the maximum clique problem

Diversification strategies in tabu search algorithms for the maximum clique problem

0.00 Avg rating0 Votes
Article ID: iaor19971541
Country: Netherlands
Volume: 63
Issue: 1
Start Page Number: 189
End Page Number: 207
Publication Date: May 1996
Journal: Annals of Operations Research
Authors: ,
Keywords: heuristics
Abstract:

The purpose of this study is to develop some understanding of the benefits that can be derived from the inclusion of diversification strategies in tabu search methods. To do so, the authors discuss the implementation of various diversification strategies in several tabu search heuristics developed for the maximum clique problem. Computational results on a large set of randomly generated test problems are reported and compared to assess the impact of these techniques on solution quality and running time.

Reviews

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