Probability Distribution of Solution Time in GRASP: An Experimental Investigation
Journal of Heuristics
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
A tabu search algorithm for the quadratic assignment problem
Computational Optimization and Applications
Multistart tabu search and diversification strategies for the quadratic assignment problem
IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Paper: Robust taboo search for the quadratic assignment problem
Parallel Computing
Computers and Operations Research
Hi-index | 0.00 |
For almost two decades the question of whether tabu search (TS) or simulated annealing (SA) performs better for the quadratic assignment problem has been unresolved. To answer this question satisfactorily, we compare performance at various values of targeted solution quality, running each heuristic at its optimal number of iterations for each target. We find that for a number of varied problem instances, SA performs better for higher quality targets while TS performs better for lower quality targets.