A new heuristic for the quadratic assignment problem

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.

• Type: Journal
• Year: 2002
• Where: JAMDS
• Authors: Zvi Drezner
• Keywords: Heuristic, Heuristic Combines Ideas, JAMDS 2002, Quadratic Assignment Problem