A multi-start random constructive heuristic for the container loading problem
Autor(a) principal: | |
---|---|
Data de Publicação: | 2007 |
Outros Autores: | |
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-74382007000200007 |
Resumo: | This paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches. |
id |
SOBRAPO-1_b67633a6d5b4f3c897ab69ad0ecd2248 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382007000200007 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
A multi-start random constructive heuristic for the container loading problemcontainer loadingcuboid arrangementmulti-start random constructive heuristicThis paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches.Sociedade Brasileira de Pesquisa Operacional2007-08-01info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersiontext/htmlhttp://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382007000200007Pesquisa Operacional v.27 n.2 2007reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382007000200007info:eu-repo/semantics/openAccessAraújo,Olinto César Bassi deArmentano,Vinícius Amaraleng2007-09-25T00:00:00Zoai:scielo:S0101-74382007000200007Revistahttp://www.scielo.br/popehttps://old.scielo.br/oai/scielo-oai.php||sobrapo@sobrapo.org.br1678-51420101-7438opendoar:2007-09-25T00:00Pesquisa operacional (Online) - Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)false |
dc.title.none.fl_str_mv |
A multi-start random constructive heuristic for the container loading problem |
title |
A multi-start random constructive heuristic for the container loading problem |
spellingShingle |
A multi-start random constructive heuristic for the container loading problem Araújo,Olinto César Bassi de container loading cuboid arrangement multi-start random constructive heuristic |
title_short |
A multi-start random constructive heuristic for the container loading problem |
title_full |
A multi-start random constructive heuristic for the container loading problem |
title_fullStr |
A multi-start random constructive heuristic for the container loading problem |
title_full_unstemmed |
A multi-start random constructive heuristic for the container loading problem |
title_sort |
A multi-start random constructive heuristic for the container loading problem |
author |
Araújo,Olinto César Bassi de |
author_facet |
Araújo,Olinto César Bassi de Armentano,Vinícius Amaral |
author_role |
author |
author2 |
Armentano,Vinícius Amaral |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Araújo,Olinto César Bassi de Armentano,Vinícius Amaral |
dc.subject.por.fl_str_mv |
container loading cuboid arrangement multi-start random constructive heuristic |
topic |
container loading cuboid arrangement multi-start random constructive heuristic |
description |
This paper deals with the container loading problem which involves the selection of a subset of boxes, each box with a given volume, such that they fit in a single container and maximize its volume utilization subject to orientation and stability constraints. We propose a multi-start random constructive heuristic with a load arrangement that is based on maximal cuboids that fit in given empty spaces. Each instance is adaptively evaluated by a set of criteria, and at each step of the construction process one maximal cuboid is chosen probabilistically from a restricted list of candidates. In order to enhance the flexibility in the construction of a solution, a probabilistic reduction on such cuboids is allowed. Computational tests on several instances from the literature show that the proposed method performs better than other approaches. |
publishDate |
2007 |
dc.date.none.fl_str_mv |
2007-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-74382007000200007 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382007000200007 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0101-74382007000200007 |
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.27 n.2 2007 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_ |
1750318016644513792 |