| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9664082 | European Journal of Operational Research | 2005 | 7 Pages |
Abstract
In this paper we propose to extend the concentric tabu search for the quadratic assignment problem to include more permissible moves. Two extensions are suggested and tested. The computational comparisons with existing hybrid genetic algorithms provide comparable solutions to the best available algorithms.
Related Topics
Physical Sciences and Engineering
Computer Science
Computer Science (General)
Authors
Zvi Drezner,