A new heuristic for the quadratic assignment problem (Q1428288): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:18, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new heuristic for the quadratic assignment problem |
scientific article |
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
