Abstract
The quadratic assignment problem (QAP) is among the most commonly encountered combinatorial optimization problems. Recently, various tabu search implementations have been proposed to solve the QAP efficiently. These approaches mainly investigate tabu list management ideas that do not take account of logical interdependencies deriving from the sequence in which solutions are generated. Here we apply different versions of the reverse elimination method (REM), a dynamic strategy that explicitly incorporates logical interdependencies. We also introduce a new type of intensification strategy based on a clustering approach and combine it with some diversification ideas. Computational results are reported for a large number of benchmark problems up to the dimension of 128. Our version of REM improves on some of the best known results and matches them for most of the remaining problems.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Battiti and G. Tecchiolli, 1992. Parallel biased search for combinato rial optimization:genetic algorithms and tabu search. Microprocessors and Microsystems, 16, 351–367.
R. Battiti and G. Tecchiolli, 1992. The reactive tabu search. Preprint, Department of Mathematics, University of Trento
E.C. Buffa, G.C. Armour and T.E. Vollmann, 1962. Allocating facilities with CRAFT. Harvard Business Review, 42, 136–158.
R.E. Burkard, S. Karisch and F. Rendl, 1991. QAPLIB—a quadratic as signment problem library. European Journal of Operational Research, 55, 115–119.
J. Chakrapani and J. Skorin-Kapov, 1992. A connectionist approach to the quadratic assignment problem. Computers & Operations Research, 19, 287–295.
J. Chakrapani and J. Skorin-Kapov, 1993. Massively parallel tabu search for the quadratic assignment problem. Annals of Operations Research, 41, 327–341.
F. Dammeyer, P. Forst and S. Voß, 1991. On the cancellation sequence method of tabu search. ORS A Journal on Computing, 3, 262–265.
F. Dammeyer and S. Voß, 1993. Dynamic tabu list management using the reverse elimination method. Annals of Operations Research, 41, 31–46.
W. Domschke, P. Forst and S. Voß, 1992. Tabu search techniques for the quadratic semi-assignment problem. In:G. Fandel, T. Gulledge and A. Jones (eds.), New Directions for Operations Research in Manufacturing (Springer, Berlin), pp. 389–405.
C.N. Fiechter, A. Rogger and D. de Werra, 1992. Basic ideas of tabu search with an application to traveling salesman and quadratic assign ment. Ricerca Operativa, 62, 5–28.
G. Finke, R.E. Burkard and F. Rendl, 1987. Quadratic assignment prob lems. Annals of Discrete Mathematics, 31, 61–82.
F. Glover, 1990. Tabu search—part II. ORSA Journal on Computing, 2, 4–32.
F. Glover and M. Laguna, 1993. Tabu search. In:C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems (Blackwell, Oxford), pp. 70–150.
V. Nissen, 1993. A new efficient evolutionary algorithm for the quadratic assignment problem. In:K.-W. Hansmann, A. Bachern, M. Jarke, W.E. Katzenberger and A. Marusev (eds.), Operations Research Proceedings 1992 (Springer, Berlin), pp. 259–267.
J. Skorin-Kapov, 1990. Tabu search applied to the quadratic assignment problem. ORSA Journal on Computing, 2, 33–45.
E. Taillard, 1991. Robust taboo search for the quadratic assignment prob lem. Parallel Computing, 17, 443–455.
K.Y. Tarn, 1992. Genetic algorithms, function optimization, and facility layout design. European Journal of Operational Research, 63, 322–346.
S. Voß, 1993. Tabu search:applications and prospects. In:D.-Z. Du and P.M. Pardalos (eds.), Network Optimization Problems:Algorithms, Appli cations and Complexity (World Scientific, Singapore), pp. 333–353.
M.R. William and T.L. Ward, 1987. Solving quadratic assignment prob lems by’ simulated annealing’. HE Transactions, 19, 107–119.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Voß, S. (1995). Solving Quadratic Assignment Problems Using the Reverse Elimination Method. In: Nash, S.G., Sofer, A., Stewart, W.R., Wasil, E.A. (eds) The Impact of Emerging Technologies on Computer Science and Operations Research. Operations Research/Computer Science Interfaces Series, vol 4. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2223-2_14
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2223-2_14
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5934-0
Online ISBN: 978-1-4615-2223-2
eBook Packages: Springer Book Archive