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
%0 Conference Paper
%1 592289
%A Cung, Van-Dat
%A Mautor, T.
%A Michelon, P.
%A Tavares, A.
%B Evolutionary Computation, 1997., IEEE International Conference on
%D 1997
%K *file-import-12-02-14 algorithmsheuristic, assignment, combinationsquadratic, diversification, heuristicgood, initial, linear, problems, problemscatter, programmingquadratic, programmingsearch, scattered, searchgenetic, solutionsintensification, stageevolutionary, stageoperatorpopulation, subset,
%P 165--169
%R 10.1109/ICEC.1997.592289
%T A scatter search based approach for the quadratic assignment problem
%U http://dx.doi.org/10.1109/ICEC.1997.592289
%X 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
@inproceedings{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}},
added-at = {2012-03-02T03:39:18.000+0100},
author = {Cung, Van-Dat and Mautor, T. and Michelon, P. and Tavares, A.},
biburl = {https://www.bibsonomy.org/bibtex/2fc92816b13611e63cb8d3be85f4e7b68/baby9992006},
booktitle = {Evolutionary Computation, 1997., IEEE International Conference on},
citeulike-article-id = {10349839},
citeulike-linkout-0 = {http://dx.doi.org/10.1109/ICEC.1997.592289},
doi = {10.1109/ICEC.1997.592289},
interhash = {0d5adbdbaae9f7fd27b7507fe9ee42d1},
intrahash = {fc92816b13611e63cb8d3be85f4e7b68},
keywords = {*file-import-12-02-14 algorithmsheuristic, assignment, combinationsquadratic, diversification, heuristicgood, initial, linear, problems, problemscatter, programmingquadratic, programmingsearch, scattered, searchgenetic, solutionsintensification, stageevolutionary, stageoperatorpopulation, subset,},
month = apr,
pages = {165--169},
posted-at = {2012-02-14 03:26:54},
priority = {2},
timestamp = {2012-03-02T03:39:23.000+0100},
title = {{A scatter search based approach for the quadratic assignment problem}},
url = {http://dx.doi.org/10.1109/ICEC.1997.592289},
year = 1997
}