Journal of Applied Mathematics and Decision Sciences
Volume 6 (2002), Issue 3, Pages 143-153
doi:10.1155/S1173912602000093
A new heuristic for the quadratic assignment problem
College of Business and Economics, California State University, Fullerton 92834, CA, USA
Copyright © 2002 Zvi Drezner. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
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.