Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods

Abstract

This paper reports heuristic and exact solution advances for the Quadratic Assignment Problem (QAP). QAP instances most often discussed in the literature are relatively well solved by heuristic approaches. Indeed, solutions at a fraction of one percent from the best known solution values are rapidly found by most heuristic methods. Exact methods are not able to prove optimality for these instances as soon as the problem size approaches 30 to 40. This article presents new QAP instances that are ill conditioned for many metaheuristic-based methods. However, these new instances are shown to be solved relatively well by some exact methods, since problem instances up to a size of 75 have been exactly solved.

DOI: 10.1007/s10479-005-3444-z

Extracted Key Phrases

15 Figures and Tables

Statistics

051015'04'05'06'07'08'09'10'11'12'13'14'15'16'17
Citations per Year

69 Citations

Semantic Scholar estimates that this publication has 69 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Drezner2005RecentAF, title={Recent Advances for the Quadratic Assignment Problem with Special Emphasis on Instances that are Difficult for Meta-Heuristic Methods}, author={Zvi Drezner and Peter M. Hahn and {\'E}ric D. Taillard}, journal={Annals OR}, year={2005}, volume={139}, pages={65-94} }