Abstract
Diversification is among the most versatile strategic components of tabu search. In this paper we propose and investigate a star-shaped approach providing multiple disjoint search trajectories scattering over the solution space. The approach is based on a dynamic strategy that explicitly incorporates logical interdependencies between multiple lists representing these trajectories. Numerical results are presented for some benchmark instances derived from the problem of balancing hydraulic turbine runners, which may be formulated as a quadratic assignment problem.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
R. Battiti and G. Tecchiolli, The reactive tabu search. ORSA Journal on Computing 6 (1994) 126–140.
R.E. Burkard, S. Karisch and F. Rendl, QAPLIB-a quadratic assignment problem library. European Journal of Operational Research 55 (1991) 115–119.
J. Chakrapani and J. Skorin-Kapov, Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research 41 (1993) 327–341.
F. Dammeyer and S. Voß, Dynamic tabu list management using the reverse elimination method. Annals of Operations Research 41 (1993) 31–46.
Y. Fathi and K.K. Ginjupalli, A mathematical model and a heuristic procedure for the turbine balancing problem. European Journal of Operational Research 63 (1993) 336–342.
F. Glover, Tabu search — part II. ORSA Journal on Computing 2 (1990) 4–32.
F. Glover and M. Laguna, Tabu search. In: Modern Heuristic Techniques for Combinatorial Problems, ed. C.R. Reeves (Blackwell, Oxford, 1993) 70–150.
J.P. Kelly, M. Laguna and F. Glover, A study of diversification strategies for the quadratic assignment problem. Computers & Operations Research 21 (1994) 885–893.
G. Laporte and H. Mercure, Balancing hydraulic turbine runners: A quadratic assignment problem. European Journal of Operational Research 35 (1988) 378–381.
J. Mosevich, Balancing hydraulic turbine runners — A discrete combinatorial optimization problem. European Journal of Operational Research 26 (1986) 202–204.
P.M. Pardalos and H. Wolkowicz (eds.), Quadratic assignment and related problems. (DIMACS Series Discr. Math, and Theoret. Comp. Science, American Math. Society, Providence, 1994).
M. Sinclair, Comparison of the performance of modern heuristics for combinatorial optimization on real data. Computers & Operations Research 20 (1993) 687–695.
J. Skorin-Kapov, Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing 2 (1990) 33–45.
P. Soriano and M. Gendreau, Diversification strategies in tabu search algorithms for the maximum clique problem. Working Paper CRT-940, Centre de recherche sur les Transports, Montreal (1993).
E. Taillard, Robust taboo search for the quadratic assignment problem. Parallel Computing 17 (1991) 443–455.
E. Taillard, Comparison of iterative searches for the quadratic assignment problem. Working Paper CRT-989, Centre de recherche sur les Transports, Montreal (1994).
S. Voß, Tabu search: Applications and prospects. In: Network Optimization Problems, eds. D.-Z. Du and P.M. Pardalos (World Scientific, Singapore, 1993) 333–353.
S. Voß, Solving quadratic assignment problems using the reverse elimination method. In: The Impact of Emerging Technologies on Computer Science and Operations Research, eds. S.G. Nash and A. Sofer (Kluwer, Dordrecht, 1995) 281–296.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Kluwer Academic Publishers
About this chapter
Cite this chapter
Sondergeld, L., Voß, S. (1996). A Star-Shaped Diversification Approach in Tabu Search. In: Osman, I.H., Kelly, J.P. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1361-8_29
Download citation
DOI: https://doi.org/10.1007/978-1-4613-1361-8_29
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4612-8587-8
Online ISBN: 978-1-4613-1361-8
eBook Packages: Springer Book Archive