BibTeX
@MISC{Glover90tabusearch,
author = {Fred Glover},
title = {Tabu Search -- Part II},
year = {1990}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
This is the second half of a two part series devoted to the tabu search metastrategy for optimization problems. Part I introduced the fundamental ideas of tabu search as an approach for guiding other heuristics to overcome the limitations of local optimality, both in a deterministic and a probabilistic framework. Part I also reported successful applications from a wide range of settings, in which tabu search frequently made it possible to obtain higher quality solutions than previously obtained with competing strategies, generally with less computational effort. Part 11, in this issue, examines refinements and more advanced aspects of tabu search. Following a brief review of notation, Part I1 introduces new dynamic strategies for managing tabu lists, allowing fuller exploitation of underlying evaluation functions. In turn, the elements of staged search and structured move sets are characterized, which bear on the issue of finiteness. Three ways of applying tabu search to the solution of integer programming problems are then described, providing connections also to certain nonlinear programming applications. Finally, the paper concludes with a brief survey of new applications of tabu search that have occurred since the developments reported in Part I. Together with additional comparisons with other methods on a wide body of problems, these include results of parallel processing implementations and the use of tabu search in settings ranging from telecommunications to neural networks. A s a prelude to the considerations of this paper, we
Keyphrases
tabu search parallel processing implementation new dynamic strategy part series certain nonlinear programming application wide range wide body local optimality neural network probabilistic framework part i1 tabu list integer programming problem quality solution brief survey fundamental idea move set optimization problem tabu search metastrategy second half successful application brief review advanced aspect new application fuller exploitation underlying evaluation function additional comparison computational effort
