Scatter search based approach for the quadratic assignment problem
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 pro...
| Authors: | , , , |
|---|---|
| Format: | article |
| Status: | Published version |
| Publication Date: | 1997 |
| Country: | Brasil |
| Institution: | Universidade Federal de Ouro Preto (UFOP) |
| Repository: | Repositório Institucional da UFOP |
| Language: | English |
| OAI Identifier: | oai:repositorio.ufop.br:123456789/1791 |
| Online Access: | http://www.repositorio.ufop.br/handle/123456789/1791 |
| Access Level: | Open access |
| Keyword: | Evolutionary algorithms Heuristic methods Quadratic assignment problem |
| Summary: | 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 |
|---|