Solving the 3D container ship loading planning problem by representation by rules and beam search
Main Author: | |
---|---|
Publication Date: | 2012 |
Other Authors: | , , , , |
Format: | Conference object |
Language: | eng |
Source: | Repositório Institucional da UNESP |
Download full: | http://hdl.handle.net/11449/231285 |
Summary: | This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to remove the container whose destination is the port j+1, because it is located above the container we want to download. This operation is called shifting. A ship container carrying cargo to several ports may require a large number of shifting operations. These operations spend a lot of time and cost and can be avoided by using efficient stowage planning. The key objective of the stowage planning is to minimize the number of container movements and also the ship instability. The binary formulation of this problem is properly described and also an alternative formulation called representation by rules is proposed. A Beam Search is combined with representation by rules to solve the 3D CLPP in manner that ensures that every solution analyzed in the optimization process is compact and feasible. |
id |
UNSP_ab10027ea1ec37a765788a8d4373564b |
---|---|
oai_identifier_str |
oai:repositorio.unesp.br:11449/231285 |
network_acronym_str |
UNSP |
network_name_str |
Repositório Institucional da UNESP |
repository_id_str |
2946 |
spelling |
Solving the 3D container ship loading planning problem by representation by rules and beam search3D Container ship StowageBeam search methodCombinatorial optimizationThis paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to remove the container whose destination is the port j+1, because it is located above the container we want to download. This operation is called shifting. A ship container carrying cargo to several ports may require a large number of shifting operations. These operations spend a lot of time and cost and can be avoided by using efficient stowage planning. The key objective of the stowage planning is to minimize the number of container movements and also the ship instability. The binary formulation of this problem is properly described and also an alternative formulation called representation by rules is proposed. A Beam Search is combined with representation by rules to solve the 3D CLPP in manner that ensures that every solution analyzed in the optimization process is compact and feasible.Mathematics Department State of São Paulo University, Av. Dr. Ariberto Pereira da Cunha, 333, GuaratinguetáDepartment of Science and Technology Federal University of São Paulo, São José dos CamposMathematics Department State University of Campinas, Rua Sérgio Buarquede Holanda, 651, CampinasUniversidade de São Paulo (USP)Universidade Estadual de Campinas (UNICAMP)De Azevedo, Anibal TavaresRibeiro, Cassilda MariaDe Sena, Galeno JoséChaves, Antônio AugustoNeto, Luis Leduíno SallesMoretti, Antônio Carlos2022-04-29T08:44:29Z2022-04-29T08:44:29Z2012-06-13info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObject132-141ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, p. 132-141.http://hdl.handle.net/11449/2312852-s2.0-84861994192Scopusreponame:Repositório Institucional da UNESPinstname:Universidade Estadual Paulista (UNESP)instacron:UNESPengICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systemsinfo:eu-repo/semantics/openAccess2022-04-29T08:44:29Zoai:repositorio.unesp.br:11449/231285Repositório InstitucionalPUBhttp://repositorio.unesp.br/oai/requestopendoar:29462022-04-29T08:44:29Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP)false |
dc.title.none.fl_str_mv |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
title |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
spellingShingle |
Solving the 3D container ship loading planning problem by representation by rules and beam search De Azevedo, Anibal Tavares 3D Container ship Stowage Beam search method Combinatorial optimization |
title_short |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
title_full |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
title_fullStr |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
title_full_unstemmed |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
title_sort |
Solving the 3D container ship loading planning problem by representation by rules and beam search |
author |
De Azevedo, Anibal Tavares |
author_facet |
De Azevedo, Anibal Tavares Ribeiro, Cassilda Maria De Sena, Galeno José Chaves, Antônio Augusto Neto, Luis Leduíno Salles Moretti, Antônio Carlos |
author_role |
author |
author2 |
Ribeiro, Cassilda Maria De Sena, Galeno José Chaves, Antônio Augusto Neto, Luis Leduíno Salles Moretti, Antônio Carlos |
author2_role |
author author author author author |
dc.contributor.none.fl_str_mv |
Universidade de São Paulo (USP) Universidade Estadual de Campinas (UNICAMP) |
dc.contributor.author.fl_str_mv |
De Azevedo, Anibal Tavares Ribeiro, Cassilda Maria De Sena, Galeno José Chaves, Antônio Augusto Neto, Luis Leduíno Salles Moretti, Antônio Carlos |
dc.subject.por.fl_str_mv |
3D Container ship Stowage Beam search method Combinatorial optimization |
topic |
3D Container ship Stowage Beam search method Combinatorial optimization |
description |
This paper formulates the 3D Container ship Loading Planning Problem (3D CLPP) and also proposes a new and compact representation to efficiently solve it. Containers on board a Container ship are placed in vertical stacks, located in different sections. The only way to access the containers is through the top of the stack. In order to unload a container at a given port j, it is necessary to remove the container whose destination is the port j+1, because it is located above the container we want to download. This operation is called shifting. A ship container carrying cargo to several ports may require a large number of shifting operations. These operations spend a lot of time and cost and can be avoided by using efficient stowage planning. The key objective of the stowage planning is to minimize the number of container movements and also the ship instability. The binary formulation of this problem is properly described and also an alternative formulation called representation by rules is proposed. A Beam Search is combined with representation by rules to solve the 3D CLPP in manner that ensures that every solution analyzed in the optimization process is compact and feasible. |
publishDate |
2012 |
dc.date.none.fl_str_mv |
2012-06-13 2022-04-29T08:44:29Z 2022-04-29T08:44:29Z |
dc.type.status.fl_str_mv |
info:eu-repo/semantics/publishedVersion |
dc.type.driver.fl_str_mv |
info:eu-repo/semantics/conferenceObject |
format |
conferenceObject |
status_str |
publishedVersion |
dc.identifier.uri.fl_str_mv |
ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, p. 132-141. http://hdl.handle.net/11449/231285 2-s2.0-84861994192 |
identifier_str_mv |
ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, p. 132-141. 2-s2.0-84861994192 |
url |
http://hdl.handle.net/11449/231285 |
dc.language.iso.fl_str_mv |
eng |
language |
eng |
dc.relation.none.fl_str_mv |
ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems |
dc.rights.driver.fl_str_mv |
info:eu-repo/semantics/openAccess |
eu_rights_str_mv |
openAccess |
dc.format.none.fl_str_mv |
132-141 |
dc.source.none.fl_str_mv |
Scopus reponame:Repositório Institucional da UNESP instname:Universidade Estadual Paulista (UNESP) instacron:UNESP |
instname_str |
Universidade Estadual Paulista (UNESP) |
instacron_str |
UNESP |
institution |
UNESP |
reponame_str |
Repositório Institucional da UNESP |
collection |
Repositório Institucional da UNESP |
repository.name.fl_str_mv |
Repositório Institucional da UNESP - Universidade Estadual Paulista (UNESP) |
repository.mail.fl_str_mv |
|
_version_ |
1797789925692669952 |