Lower and Upper Bounds for the Master Bay Planning Problem
Abstract: In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the efficiency and the effectiveness of the bounds proposed, we conduct an experiment over three different sets of instances. This allows us to determine the specific conditions in which the bounds can be used.
Saved in:
| Main Authors: | , , , , , , |
|---|---|
| Format: | Digital revista |
| Language: | English |
| Published: |
EDITADA (EDITorial Academica Dragon Azteca, S. de R.L. de C.V. or Aztec Dragon Academic Publishing)
2015
|
| Online Access: | http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S2007-15582015000100042 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| id |
oai:scielo:S2007-15582015000100042 |
|---|---|
| record_format |
ojs |
| spelling |
oai:scielo:S2007-155820150001000422016-10-19Lower and Upper Bounds for the Master Bay Planning ProblemCruz-Reyes,LauraHernández Hernández,PaulaMelin,PatriciaMar-Ortiz,JulioFraire Huacuja,Héctor JoaquínPuga Soberanes,Héctor JoséGonzález Barbosa,Juan Javier Lower bound upper bound Master Bay Planning Problem combinatorial optimization Abstract: In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the efficiency and the effectiveness of the bounds proposed, we conduct an experiment over three different sets of instances. This allows us to determine the specific conditions in which the bounds can be used.info:eu-repo/semantics/openAccessEDITADA (EDITorial Academica Dragon Azteca, S. de R.L. de C.V. or Aztec Dragon Academic Publishing)International Journal of Combinatorial Optimization Problems and Informatics v.6 n.1 20152015-04-01info:eu-repo/semantics/articletext/htmlhttp://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S2007-15582015000100042en |
| institution |
SCIELO |
| collection |
OJS |
| country |
México |
| countrycode |
MX |
| component |
Revista |
| access |
En linea |
| databasecode |
rev-scielo-mx |
| tag |
revista |
| region |
America del Norte |
| libraryname |
SciELO |
| language |
English |
| format |
Digital |
| author |
Cruz-Reyes,Laura Hernández Hernández,Paula Melin,Patricia Mar-Ortiz,Julio Fraire Huacuja,Héctor Joaquín Puga Soberanes,Héctor José González Barbosa,Juan Javier |
| spellingShingle |
Cruz-Reyes,Laura Hernández Hernández,Paula Melin,Patricia Mar-Ortiz,Julio Fraire Huacuja,Héctor Joaquín Puga Soberanes,Héctor José González Barbosa,Juan Javier Lower and Upper Bounds for the Master Bay Planning Problem |
| author_facet |
Cruz-Reyes,Laura Hernández Hernández,Paula Melin,Patricia Mar-Ortiz,Julio Fraire Huacuja,Héctor Joaquín Puga Soberanes,Héctor José González Barbosa,Juan Javier |
| author_sort |
Cruz-Reyes,Laura |
| title |
Lower and Upper Bounds for the Master Bay Planning Problem |
| title_short |
Lower and Upper Bounds for the Master Bay Planning Problem |
| title_full |
Lower and Upper Bounds for the Master Bay Planning Problem |
| title_fullStr |
Lower and Upper Bounds for the Master Bay Planning Problem |
| title_full_unstemmed |
Lower and Upper Bounds for the Master Bay Planning Problem |
| title_sort |
lower and upper bounds for the master bay planning problem |
| description |
Abstract: In this work we tackle the problem of the stowage of containers on a ship, the so-called Master Bay Planning Problem (MBPP). This is an important hard combinatorial optimization problem in the context of maritime port logistics which has proven to be really difficult to solve. We propose two new lower bounds and two new upper bounds which are useful to solve it. In order to test both the efficiency and the effectiveness of the bounds proposed, we conduct an experiment over three different sets of instances. This allows us to determine the specific conditions in which the bounds can be used. |
| publisher |
EDITADA (EDITorial Academica Dragon Azteca, S. de R.L. de C.V. or Aztec Dragon Academic Publishing) |
| publishDate |
2015 |
| url |
http://www.scielo.org.mx/scielo.php?script=sci_arttext&pid=S2007-15582015000100042 |
| work_keys_str_mv |
AT cruzreyeslaura lowerandupperboundsforthemasterbayplanningproblem AT hernandezhernandezpaula lowerandupperboundsforthemasterbayplanningproblem AT melinpatricia lowerandupperboundsforthemasterbayplanningproblem AT marortizjulio lowerandupperboundsforthemasterbayplanningproblem AT frairehuacujahectorjoaquin lowerandupperboundsforthemasterbayplanningproblem AT pugasoberaneshectorjose lowerandupperboundsforthemasterbayplanningproblem AT gonzalezbarbosajuanjavier lowerandupperboundsforthemasterbayplanningproblem |
| _version_ |
1756230156838502400 |