A new heuristic for the quadratic assignment problem (Q1428288)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A new heuristic for the quadratic assignment problem |
scientific article; zbMATH DE number 2062017
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for the quadratic assignment problem |
scientific article; zbMATH DE number 2062017 |
Statements
A new heuristic for the quadratic assignment problem (English)
0 references
25 March 2004
0 references
Summary: 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.
0 references
