Scatter search based approach for the quadratic assignment problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 1997 |
Outros Autores: | , , |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Institucional da UFOP |
dARK ID: | ark:/61566/0013000003836 |
Texto Completo: | http://www.repositorio.ufop.br/handle/123456789/1791 |
Resumo: | 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 |
id |
UFOP_12b6840b0bcaddac7c2e2a4e940bc042 |
---|---|
oai_identifier_str |
oai:repositorio.ufop.br:123456789/1791 |
network_acronym_str |
UFOP |
network_name_str |
Repositório Institucional da UFOP |
repository_id_str |
3233 |
spelling |
Scatter search based approach for the quadratic assignment problemEvolutionary algorithmsHeuristic methodsQuadratic assignment problemScatter 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 solutions2012-11-13T19:03:19Z2012-11-13T19:03:19Z1997info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfCUNG, 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. 2012http://www.repositorio.ufop.br/handle/123456789/1791ark:/61566/0013000003836Cung, Van DatMautor, ThierryMichelon, Philippe Yves PaulTavares, Andréa Iabrudiengreponame:Repositório Institucional da UFOPinstname:Universidade Federal de Ouro Preto (UFOP)instacron:UFOPinfo:eu-repo/semantics/openAccess2024-11-10T15:04:55Zoai:repositorio.ufop.br:123456789/1791Repositório InstitucionalPUBhttp://www.repositorio.ufop.br/oai/requestrepositorio@ufop.edu.bropendoar:32332024-11-10T15:04:55Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP)false |
dc.title.none.fl_str_mv |
Scatter search based approach for the quadratic assignment problem |
title |
Scatter search based approach for the quadratic assignment problem |
spellingShingle |
Scatter search based approach for the quadratic assignment problem Cung, Van Dat Evolutionary algorithms Heuristic methods Quadratic assignment problem |
title_short |
Scatter search based approach for the quadratic assignment problem |
title_full |
Scatter search based approach for the quadratic assignment problem |
title_fullStr |
Scatter search based approach for the quadratic assignment problem |
title_full_unstemmed |
Scatter search based approach for the quadratic assignment problem |
title_sort |
Scatter search based approach for the quadratic assignment problem |
author |
Cung, Van Dat |
author_facet |
Cung, Van Dat Mautor, Thierry Michelon, Philippe Yves Paul Tavares, Andréa Iabrudi |
author_role |
author |
author2 |
Mautor, Thierry Michelon, Philippe Yves Paul Tavares, Andréa Iabrudi |
author2_role |
author author author |
dc.contributor.author.fl_str_mv |
Cung, Van Dat Mautor, Thierry Michelon, Philippe Yves Paul Tavares, Andréa Iabrudi |
dc.subject.por.fl_str_mv |
Evolutionary algorithms Heuristic methods Quadratic assignment problem |
topic |
Evolutionary algorithms Heuristic methods Quadratic assignment problem |
description |
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 |
publishDate |
1997 |
dc.date.none.fl_str_mv |
1997 2012-11-13T19:03:19Z 2012-11-13T19:03:19Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
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 http://www.repositorio.ufop.br/handle/123456789/1791 |
dc.identifier.dark.fl_str_mv |
ark:/61566/0013000003836 |
identifier_str_mv |
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 ark:/61566/0013000003836 |
url |
http://www.repositorio.ufop.br/handle/123456789/1791 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.source.none.fl_str_mv |
reponame:Repositório Institucional da UFOP instname:Universidade Federal de Ouro Preto (UFOP) instacron:UFOP |
instname_str |
Universidade Federal de Ouro Preto (UFOP) |
instacron_str |
UFOP |
institution |
UFOP |
reponame_str |
Repositório Institucional da UFOP |
collection |
Repositório Institucional da UFOP |
repository.name.fl_str_mv |
Repositório Institucional da UFOP - Universidade Federal de Ouro Preto (UFOP) |
repository.mail.fl_str_mv |
repositorio@ufop.edu.br |
_version_ |
1817705750939566080 |