A heuristic for the minimization of open stacks problem

Detalhes bibliográficos
Autor(a) principal: Ashikaga,Fernando Masanori
Data de Publicação: 2009
Outros Autores: Soma,Nei Yoshihiro
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-74382009000200010
Resumo: It is suggested here a fast and easy to implement heuristic for the minimization of open stacks problem (MOSP). The problem is modeled as a traversing problem in a graph (Gmosp) with a special structure (Yanasse, 1997b). It was observed in Ashikaga (2001) that, in the mean experimental case, Gmosp has large cliques and high edge density. This information was used to implement a heuristic based on the extension-rotation algorithm of Pósa (1976) for approximation of Hamiltonian Circuits. Additionally, an initial path for Pósa's algorithm is derived from the vertices of an ideally maximum clique in order to accelerate the process. Extensive computational tests show that the resulting simple approach dominates in time and mean error the fast actually know Yuen (1991 and 1995) heuristic to the problem.
id SOBRAPO-1_1f974ab70f21b846d1cdf23f09dc4747
oai_identifier_str oai:scielo:S0101-74382009000200010
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling A heuristic for the minimization of open stacks problemminimization of open stacksextension-rotation heuristiccliqueIt is suggested here a fast and easy to implement heuristic for the minimization of open stacks problem (MOSP). The problem is modeled as a traversing problem in a graph (Gmosp) with a special structure (Yanasse, 1997b). It was observed in Ashikaga (2001) that, in the mean experimental case, Gmosp has large cliques and high edge density. This information was used to implement a heuristic based on the extension-rotation algorithm of Pósa (1976) for approximation of Hamiltonian Circuits. Additionally, an initial path for Pósa's algorithm is derived from the vertices of an ideally maximum clique in order to accelerate the process. Extensive computational tests show that the resulting simple approach dominates in time and mean error the fast actually know Yuen (1991 and 1995) heuristic to the problem.Sociedade Brasileira de Pesquisa Operacional2009-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000200010Pesquisa Operacional v.29 n.2 2009reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382009000200010info:eu-repo/semantics/openAccessAshikaga,Fernando MasanoriSoma,Nei Yoshihiroeng2009-10-02T00:00:00Zoai:scielo:S0101-74382009000200010Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2009-10-02T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv A heuristic for the minimization of open stacks problem
title A heuristic for the minimization of open stacks problem
spellingShingle A heuristic for the minimization of open stacks problem
Ashikaga,Fernando Masanori
minimization of open stacks
extension-rotation heuristic
clique
title_short A heuristic for the minimization of open stacks problem
title_full A heuristic for the minimization of open stacks problem
title_fullStr A heuristic for the minimization of open stacks problem
title_full_unstemmed A heuristic for the minimization of open stacks problem
title_sort A heuristic for the minimization of open stacks problem
author Ashikaga,Fernando Masanori
author_facet Ashikaga,Fernando Masanori
Soma,Nei Yoshihiro
author_role author
author2 Soma,Nei Yoshihiro
author2_role author
dc.contributor.author.fl_str_mv Ashikaga,Fernando Masanori
Soma,Nei Yoshihiro
dc.subject.por.fl_str_mv minimization of open stacks
extension-rotation heuristic
clique
topic minimization of open stacks
extension-rotation heuristic
clique
description It is suggested here a fast and easy to implement heuristic for the minimization of open stacks problem (MOSP). The problem is modeled as a traversing problem in a graph (Gmosp) with a special structure (Yanasse, 1997b). It was observed in Ashikaga (2001) that, in the mean experimental case, Gmosp has large cliques and high edge density. This information was used to implement a heuristic based on the extension-rotation algorithm of Pósa (1976) for approximation of Hamiltonian Circuits. Additionally, an initial path for Pósa's algorithm is derived from the vertices of an ideally maximum clique in order to accelerate the process. Extensive computational tests show that the resulting simple approach dominates in time and mean error the fast actually know Yuen (1991 and 1995) heuristic to the problem.
publishDate 2009
dc.date.none.fl_str_mv 2009-08-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-74382009000200010
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382009000200010
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382009000200010
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.29 n.2 2009
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_ 1750318016987398144

Registros relacionados