A new heuristic for the quadratic assignment problem

A new heuristic for the quadratic assignment problem

0.00 Avg rating0 Votes
Article ID: iaor20031201
Country: United States
Volume: 6
Issue: 3
Start Page Number: 143
End Page Number: 153
Publication Date: Sep 2002
Journal: Journal of Applied Mathematics & Decision Sciences
Authors:
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.