Heuristics and Asymptotic Behavior
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.
KeywordsSimulated Annealing Feasible Solution Tabu Search Travel Salesman Problem Travel Salesman Problem
Unable to display preview. Download preview PDF.