Scatter search based approach for the quadratic assignment problem

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.creatorCung, Van Dat-
Autor(es): dc.creatorMautor, Thierry-
Autor(es): dc.creatorMichelon, Philipe-
Autor(es): dc.creatorTavares, Andréa Iabrudi-
Data de aceite: dc.date.accessioned2019-11-06T13:25:35Z-
Data de disponibilização: dc.date.available2019-11-06T13:25:35Z-
Data de envio: dc.date.issued2012-11-13-
Data de envio: dc.date.issued2012-11-13-
Data de envio: dc.date.issued1997-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/123456789/1791-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/capes/555115-
Descrição: dc.descriptionScatter 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-
Idioma: dc.languageen-
Palavras-chave: dc.subjectEvolutionary algorithms-
Palavras-chave: dc.subjectHeuristic methods-
Palavras-chave: dc.subjectQuadratic assignment problem-
Título: dc.titleScatter search based approach for the quadratic assignment problem-
Aparece nas coleções:Repositório Institucional - UFOP

Não existem arquivos associados a este item.