Abstract
We saw in the previous section that only small QAP instances (instances of size up to 22) can be solved to optimality. On the other side, the large spectrum of applications of the QAP often leads to instances of much larger size. Under these conditions, polynomial time heuristics providing suboptimal solutions to the QAP abound in the literature. Without pretending to mention all kinds of heuristic approaches which have been applied to QAPs, we try to review the main and most fruitful ideas in this research direction. There are five main streams of heuristic approaches to QAP, listed in chronological order below.
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.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Çela, E. (1998). Heuristics and Asymptotic Behavior. In: The Quadratic Assignment Problem. Combinatorial Optimization, vol 1. Springer, Boston, MA. https://doi.org/10.1007/978-1-4757-2787-6_3
Download citation
DOI: https://doi.org/10.1007/978-1-4757-2787-6_3
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4419-4786-4
Online ISBN: 978-1-4757-2787-6
eBook Packages: Springer Book Archive