A scatter search based approach for the quadratic assignment problem
- 22 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 165-169
- https://doi.org/10.1109/icec.1997.592289
Abstract
Scatter search is an evolutionary heuristic, proposed two decades ago, that uses linear combinations of a population subset to create new solutions. A special operator is used to ensure their feasibility and to improve their quality. The authors propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and they present a procedure to generate good scattered initial solutions.Keywords
This publication has 8 references indexed in Scilit:
- Comparison of iterative searches for the quadratic assignment problemLocation Science, 1995
- A new exact algorithm for the solution of quadratic assignment problemsDiscrete Applied Mathematics, 1994
- Genetic hybrids for the quadratic assignment problemPublished by American Mathematical Society (AMS) ,1994
- The Reactive Tabu SearchINFORMS Journal on Computing, 1994
- QAPLIB-A quadratic assignment problem libraryEuropean Journal of Operational Research, 1991
- Robust taboo search for the quadratic assignment problemParallel Computing, 1991
- Tabu Search Applied to the Quadratic Assignment ProblemINFORMS Journal on Computing, 1990
- HEURISTICS FOR INTEGER PROGRAMMING USING SURROGATE CONSTRAINTSDecision Sciences, 1977