Journal of Applied Mathematics and Decision Sciences
Volume 6 (2002), Issue 3, Pages 143-153
doi:10.1155/S1173912602000093
Abstract
We propose a new heuristic for the solution of the quadratic assignment
problem. The heuristic combines ideas from tabu search and genetic algorithms. Run
times are very short compared with other heuristic procedures. The heuristic performed
very well on a set of test problems.