A new heuristic for the quadratic assignment problem

[摘要] We propose a new heuristic for the solution of the quadratic assignmentproblem. The heuristic combines ideas from tabu search and genetic algorithms. Runtimes are very short compared with other heuristic procedures. The heuristic performedvery well on a set of test problems.

[学科分类] 自然科学（综合）