Cylinder packing by simulated annealing
Autor(a) principal: | |
---|---|
Data de Publicação: | 2000 |
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-74382000000200009 |
Resumo: | This paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of items. This pattern will be repeated for each layer stacked on the pallet. Two algorithms based on the meta-heuristic Simulated Annealing have been developed and implemented. The tuning of these algorithms parameters implied running intensive tests in order to improve its efficiency. The algorithms developed were easily extended to the case of non-identical circles. |
id |
SOBRAPO-1_da0b88c5203d8cae8be67273542d6a43 |
---|---|
oai_identifier_str |
oai:scielo:S0101-74382000000200009 |
network_acronym_str |
SOBRAPO-1 |
network_name_str |
Pesquisa operacional (Online) |
repository_id_str |
|
spelling |
Cylinder packing by simulated annealingcylinder packingcombinatorial optimizationsimulated annealingThis paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of items. This pattern will be repeated for each layer stacked on the pallet. Two algorithms based on the meta-heuristic Simulated Annealing have been developed and implemented. The tuning of these algorithms parameters implied running intensive tests in order to improve its efficiency. The algorithms developed were easily extended to the case of non-identical circles.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-74382000000200009Pesquisa Operacional v.20 n.2 2000reponame:Pesquisa operacional (Online)instname:Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)instacron:SOBRAPO10.1590/S0101-74382000000200009info:eu-repo/semantics/openAccessCorreia,M. HelenaOliveira,José F.Ferreira,J. Soeiroeng2003-05-27T00:00:00Zoai:scielo:S0101-74382000000200009Revistahttp://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 |
Cylinder packing by simulated annealing |
title |
Cylinder packing by simulated annealing |
spellingShingle |
Cylinder packing by simulated annealing Correia,M. Helena cylinder packing combinatorial optimization simulated annealing |
title_short |
Cylinder packing by simulated annealing |
title_full |
Cylinder packing by simulated annealing |
title_fullStr |
Cylinder packing by simulated annealing |
title_full_unstemmed |
Cylinder packing by simulated annealing |
title_sort |
Cylinder packing by simulated annealing |
author |
Correia,M. Helena |
author_facet |
Correia,M. Helena Oliveira,José F. Ferreira,J. Soeiro |
author_role |
author |
author2 |
Oliveira,José F. Ferreira,J. Soeiro |
author2_role |
author author |
dc.contributor.author.fl_str_mv |
Correia,M. Helena Oliveira,José F. Ferreira,J. Soeiro |
dc.subject.por.fl_str_mv |
cylinder packing combinatorial optimization simulated annealing |
topic |
cylinder packing combinatorial optimization simulated annealing |
description |
This paper is motivated by the problem of loading identical items of circular base (tubes, rolls, ...) into a rectangular base (the pallet). For practical reasons, all the loaded items are considered to have the same height. The resolution of this problem consists in determining the positioning pattern of the circular bases of the items on the rectangular pallet, while maximizing the number of items. This pattern will be repeated for each layer stacked on the pallet. Two algorithms based on the meta-heuristic Simulated Annealing have been developed and implemented. The tuning of these algorithms parameters implied running intensive tests in order to improve its efficiency. The algorithms developed were easily extended to the case of non-identical circles. |
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-74382000000200009 |
url |
http://old.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382000000200009 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
10.1590/S0101-74382000000200009 |
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_ |
1750318016187334656 |