A two-stage packing problem procedure
Autor(a) principal: | |
---|---|
Data de Publicação: | 2017 |
Outros Autores: | |
Tipo de documento: | Artigo |
Idioma: | eng |
Título da fonte: | Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
Texto Completo: | http://hdl.handle.net/10773/24159 |
Resumo: | This paper deals with a two-stage packing problem that has to be solved in the daily distribution process of a Portuguese trading company. In the first stage, boxes including goods are to be packed on pallets, while in the second stage these pallets are loaded into one or more trucks. The boxes have to be transported to different customers, and the main goal is to guarantee a sufficient utilization of the truck loading space. A two-stage packing procedure is proposed to cover both problem stages. First, boxes are loaded onto pallets by means of a well-known container loading algorithm. Then, trucks are filled with loaded pallets by a tree search algorithm. The performance of the two-stage approach was evaluated using a set of instances that are based on actual company data. |
id |
RCAP_2c1b29f9db2e1dca9c9efb78dcd29c0a |
---|---|
oai_identifier_str |
oai:ria.ua.pt:10773/24159 |
network_acronym_str |
RCAP |
network_name_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository_id_str |
7160 |
spelling |
A two-stage packing problem procedureBin packingPallet loadingGRASPTree searchThis paper deals with a two-stage packing problem that has to be solved in the daily distribution process of a Portuguese trading company. In the first stage, boxes including goods are to be packed on pallets, while in the second stage these pallets are loaded into one or more trucks. The boxes have to be transported to different customers, and the main goal is to guarantee a sufficient utilization of the truck loading space. A two-stage packing procedure is proposed to cover both problem stages. First, boxes are loaded onto pallets by means of a well-known container loading algorithm. Then, trucks are filled with loaded pallets by a tree search algorithm. The performance of the two-stage approach was evaluated using a set of instances that are based on actual company data.Wiley2018-09-25T10:45:51Z2017-01-01T00:00:00Z2017info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttp://hdl.handle.net/10773/24159eng0969-601610.1111/itor.12251Moura, AnaBortfeldt, Andreasinfo:eu-repo/semantics/openAccessreponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãoinstacron:RCAAP2024-02-22T11:47:25Zoai:ria.ua.pt:10773/24159Portal AgregadorONGhttps://www.rcaap.pt/oai/openaireopendoar:71602024-03-20T02:57:54.233725Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informaçãofalse |
dc.title.none.fl_str_mv |
A two-stage packing problem procedure |
title |
A two-stage packing problem procedure |
spellingShingle |
A two-stage packing problem procedure Moura, Ana Bin packing Pallet loading GRASP Tree search |
title_short |
A two-stage packing problem procedure |
title_full |
A two-stage packing problem procedure |
title_fullStr |
A two-stage packing problem procedure |
title_full_unstemmed |
A two-stage packing problem procedure |
title_sort |
A two-stage packing problem procedure |
author |
Moura, Ana |
author_facet |
Moura, Ana Bortfeldt, Andreas |
author_role |
author |
author2 |
Bortfeldt, Andreas |
author2_role |
author |
dc.contributor.author.fl_str_mv |
Moura, Ana Bortfeldt, Andreas |
dc.subject.por.fl_str_mv |
Bin packing Pallet loading GRASP Tree search |
topic |
Bin packing Pallet loading GRASP Tree search |
description |
This paper deals with a two-stage packing problem that has to be solved in the daily distribution process of a Portuguese trading company. In the first stage, boxes including goods are to be packed on pallets, while in the second stage these pallets are loaded into one or more trucks. The boxes have to be transported to different customers, and the main goal is to guarantee a sufficient utilization of the truck loading space. A two-stage packing procedure is proposed to cover both problem stages. First, boxes are loaded onto pallets by means of a well-known container loading algorithm. Then, trucks are filled with loaded pallets by a tree search algorithm. The performance of the two-stage approach was evaluated using a set of instances that are based on actual company data. |
publishDate |
2017 |
dc.date.none.fl_str_mv |
2017-01-01T00:00:00Z 2017 2018-09-25T10:45:51Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/article |
format |
article |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
http://hdl.handle.net/10773/24159 |
url |
http://hdl.handle.net/10773/24159 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
0969-6016 10.1111/itor.12251 |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
application/pdf |
dc.publisher.none.fl_str_mv |
Wiley |
publisher.none.fl_str_mv |
Wiley |
dc.source.none.fl_str_mv |
reponame:Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) instname:Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação instacron:RCAAP |
instname_str |
Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
instacron_str |
RCAAP |
institution |
RCAAP |
reponame_str |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
collection |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) |
repository.name.fl_str_mv |
Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos) - Agência para a Sociedade do Conhecimento (UMIC) - FCT - Sociedade da Informação |
repository.mail.fl_str_mv |
|
_version_ |
1799137633303003136 |