Scatter search based approach for the quadratic assignment problem
dc.contributor.author | Cung, Van Dat | |
dc.contributor.author | Mautor, Thierry | |
dc.contributor.author | Michelon, Philippe Yves Paul | |
dc.contributor.author | Tavares, Andréa Iabrudi | |
dc.date.accessioned | 2012-11-13T19:03:19Z | |
dc.date.available | 2012-11-13T19:03:19Z | |
dc.date.issued | 1997 | |
dc.description.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. In this paper, we propose a scatter search approach to the QAP problem. The basic method is extended with intensification and diversification stages and we present a procedure to generate good scattered initial solutions | pt_BR |
dc.identifier.citation | CUNG, van D. et al. Scatter search based approach for the quadratic assignment problem. In. IEEE Conference on Evolutionary Computing, 1997. Disponível em: <http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=592289>. Acesso em: 13 nov. 2012 | pt_BR |
dc.identifier.uri | http://www.repositorio.ufop.br/handle/123456789/1791 | |
dc.language.iso | en_US | pt_BR |
dc.subject | Evolutionary algorithms | pt_BR |
dc.subject | Heuristic methods | pt_BR |
dc.subject | Quadratic assignment problem | pt_BR |
dc.title | Scatter search based approach for the quadratic assignment problem | pt_BR |
dc.type | Artigo publicado em periodico | pt_BR |