Monaldo Mastrolilli
These PowerPoint diapositives explain the main features of Tabu Search. For viewing the diapositives you need a PowerPoint viewer. You can download it in www.microsoft.com
F. Glover and S. Hanafi
We establish finite convergence for some tabu search algorithms based on recency memory or frequency memory. These are the first demonstrations of explicit bounds provided by such forms of memory, and their finiteness suggests an important distinction between these ideas and those underlying certain "probabilistic" procedures such as annealing.
Jiefeng Xu, Steve Y. Chiu and Fred Glover
We develop a Tabu Search method for this problem that incorporates long term memory, probabilistic move selections, hierarchical move evaluation, candidate list strategies and an elite solution recovery strategy.
M. Laguna, R. Martí and V. Valls
This paper first introduces an extensive review of relevant work previously published in this area. Then a tabu search implementation is presented that seeks high-quality drawings by means of an intensification phase that finds a local optimum according to an insertion mechanism and two levels of diversification.
M. Laguna, R. Martí and V. Campos
In this paper, we develop a new heuristic procedure for the linear ordering problem (LOP). The proposed algorithm is based on the tabu search methodology and incorporates strategies for search intensification and diversification.
J.E. Beasley, H. Howells and J. Sonander
In short-term conflict alert a computer system continually monitors radar data and alerts air traffic controllers if it detects a situation where two aircraft are in danger of approaching too close to one other. Within the computer program that makes up the short-term conflict alert system are a large number of parameters. We describe how tabu search, can be used to make parameter choices.
John B. Chambers and J. Wesley Barnes
This report extends a dynamic, adaptive tabu search strategy previously described for job shops with single and multiple instances of single-purpose machines, and applies it to FRJS (Flexible-Routing Job Shop). We present “proof-of-concept” results for three problems constructed from difficult JSSP (Job Shop Scheduling Problem) instances.
John B. Chambers and J. Wesley Barnes
This report describes a dynamic, adaptive tabu search strategy for JSSP incorporating elements of an earlier investigation by the authors. Improved computational results for a set of reference problems are presented.