Paper Info
Title
New Benchmark Instances for the QAP and the Experimental Analysis of Algorithms
Abstract
The quadratic assignment problem arises in a variety of practical settings. It is known to be among the hardest combinatorial problems for exact algorithms. Therefore, a large number of heuristic approaches have been proposed for its solution. In this article we introduce a new, large set of QAP instances that is intended to allow the systematic study of the performance of metaheuristics in dependence of QAP instance characteristics. Additionally, we give computational results with several high performing algorithms known from literature and give exemplary results on the influence of instance characteristics on the performance of these algorithms.
Year
DOI
Venue
2004
10.1007/978-3-540-24652-7_20
Lecture Notes in Computer Science
Keywords
Field
DocType
quadratic assignment problem,experimental analysis
Mathematical optimization,Heuristic,Evolutionary algorithm,Quadratic assignment problem,Computer science,Analysis of algorithms,Combinatorial optimization,Assignment problem,Distance matrix,Metaheuristic
Conference
Volume
ISSN
Citations 
3004
0302-9743
18
PageRank 
References 
Authors
0.84
12
2
Name
Order
Citations
PageRank
thomas stutzle15684352.15
susana fernandes moreira gonca2180.84