Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)

Detalhes bibliográficos
Autor(a) principal: Mukhacheva,E.A.
Data de Publicação: 2000
Outros Autores: Belov,G.N., Kartack,V.M., Mukhacheva,A.S.
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-74382000000200002
Resumo: Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.
id SOBRAPO-1_3edd9004324de98d2e12333edd65a094
oai_identifier_str oai:scielo:S0101-74382000000200002
network_acronym_str SOBRAPO-1
network_name_str Pesquisa operacional (Online)
repository_id_str
spelling Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)packingcuttingpseudo-valuesbranch-and-bound methodTwo algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.Sociedade Brasileira de Pesquisa Operacional2000-12-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002Pesquisa Operacional v.20 n.2 2000reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382000000200002info:eu-repo/semantics/openAccessMukhacheva,E.A.Belov,G.N.Kartack,V.M.Mukhacheva,A.S.eng2003-05-27T00:00:00Zoai:scielo:S0101-74382000000200002Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2003-05-27T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false
dc.title.none.fl_str_mv Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
spellingShingle Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
Mukhacheva,E.A.
packing
cutting
pseudo-values
branch-and-bound method
title_short Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_full Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_fullStr Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_full_unstemmed Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
title_sort Linear one-dimensional cutting-packing problems: numerical experiments with the sequential value correction method (SVC) and a modified branch-and-bound method (MBB)
author Mukhacheva,E.A.
author_facet Mukhacheva,E.A.
Belov,G.N.
Kartack,V.M.
Mukhacheva,A.S.
author_role author
author2 Belov,G.N.
Kartack,V.M.
Mukhacheva,A.S.
author2_role author
author
author
dc.contributor.author.fl_str_mv Mukhacheva,E.A.
Belov,G.N.
Kartack,V.M.
Mukhacheva,A.S.
dc.subject.por.fl_str_mv packing
cutting
pseudo-values
branch-and-bound method
topic packing
cutting
pseudo-values
branch-and-bound method
description Two algorithms for the one-dimensional cutting problem, namely, a modified branch-and-bound method (exact method) and a heuristic sequential value correction method are suggested. In order to obtain a reliable assessment of the efficiency of the algorithms, hard instances of the problem were considered and from the computational experiment it seems that the efficiency of the heuristic method appears to be superior to that of the exact one, taking into account the computing time of the latter. A detailed description of the two methods is given along with suggestions for their improvements.
publishDate 2000
dc.date.none.fl_str_mv 2000-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-74382000000200002
url http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200002
dc.language.iso.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv 10.1590/S0101-74382000000200002
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.20 n.2 2000
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_ 1750318016173703169

Registros relacionados