Combinatorial instruments in the design of a heuristic for the quadratic assignment problem

Detalhes bibliográficos
Autor(a) principal: Boaventura-Netto,Paulo Oswaldo
Data de Publicação: 2003
Tipo de documento: Artigo
Idioma: eng
Título da fonte: Pesquisa operacional (Online)
Texto Completo: http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000300001
Resumo: This work discusses the use of a neighbouring structure in the design of specific heuristics for the Quadratic Assignment Problem (QAP). This structure is formed by the 4- and 6-cycles adjacent to a vertex in the Hasse diagram of the permutation lattice and it can be adequately partitioned in subsets of linear and quadratic cardinalities, a characteristics which frequently allows an economy in the processing time. We propose also a restart strategy and a mechanism for generating initial solutions which constitute, together with the neighbouring structure, a possible QAP-specific heuristic proposal. For the construction of these instruments we used the relaxed ordered set of QAP solutions.
id SOBRAPO-1_fe37b0175eb7172d0fd4107369fcda96
oai_identifier_str oai:scielo:S0101-74382003000300001
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Combinatorial instruments in the design of a heuristic for the quadratic assignment problemquadratic assignment problemcombinatoryheuristicsThis work discusses the use of a neighbouring structure in the design of specific heuristics for the Quadratic Assignment Problem (QAP). This structure is formed by the 4- and 6-cycles adjacent to a vertex in the Hasse diagram of the permutation lattice and it can be adequately partitioned in subsets of linear and quadratic cardinalities, a characteristics which frequently allows an economy in the processing time. We propose also a restart strategy and a mechanism for generating initial solutions which constitute, together with the neighbouring structure, a possible QAP-specific heuristic proposal. For the construction of these instruments we used the relaxed ordered set of QAP solutions.Sociedade Brasileira de Pesquisa Operacional2003-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000300001Pesquisa Operacional v.23 n.3 2003reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382003000300001info:eu-repo/semantics/openAccessBoaventura-Netto,Paulo Oswaldoeng2004-02-13T00:00:00Zoai:scielo:S0101-74382003000300001Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2004-02-13T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
title Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
spellingShingle Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
Boaventura-Netto,Paulo Oswaldo
quadratic assignment problem
combinatory
heuristics
title_short Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
title_full Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
title_fullStr Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
title_full_unstemmed Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
title_sort Combinatorial instruments in the design of a heuristic for the quadratic assignment problem
author Boaventura-Netto,Paulo Oswaldo
author_facet Boaventura-Netto,Paulo Oswaldo
author_role author
dc.contributor.author.fl_str_mv Boaventura-Netto,Paulo Oswaldo
dc.subject.por.fl_str_mv quadratic assignment problem
combinatory
heuristics
topic quadratic assignment problem
combinatory
heuristics
description This work discusses the use of a neighbouring structure in the design of specific heuristics for the Quadratic Assignment Problem (QAP). This structure is formed by the 4- and 6-cycles adjacent to a vertex in the Hasse diagram of the permutation lattice and it can be adequately partitioned in subsets of linear and quadratic cardinalities, a characteristics which frequently allows an economy in the processing time. We propose also a restart strategy and a mechanism for generating initial solutions which constitute, together with the neighbouring structure, a possible QAP-specific heuristic proposal. For the construction of these instruments we used the relaxed ordered set of QAP solutions.
publishDate 2003
dc.date.none.fl_str_mv 2003-12-01
dc.type.driver.fl_str_mv info:eu-repo/semantics/article
dc.type.status.fl_str_mv info:eu-repo/semantics/publishedVersion
format article
status_str publishedVersion
dc.identifier.uri.fl_str_mv http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000300001
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000300001
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382003000300001
dc.rights.driver.fl_str_mv info:eu-repo/semantics/openAccess
eu_rights_str_mv openAccess
dc.format.none.fl_str_mv text/html
dc.publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
publisher.none.fl_str_mv Sociedade Brasileira de Pesquisa Operacional
dc.source.none.fl_str_mv Pesquisa Operacional v.23 n.3 2003
reponame:Pesquisa operacional (Online)
instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
instname_str Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron_str SOBRAPO
institution SOBRAPO
reponame_str Pesquisa operacional (Online)
collection Pesquisa operacional (Online)
repository.name.fl_str_mv Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
repository.mail.fl_str_mv ||sobrapo@sobrapo.org.br
_version_ 1750318016256540672

Registros relacionados