Saved in:
| Main Author: | |
|---|---|
| Format: | Artículo científico |
| Language: | en |
| Published: |
International Journal of Combinatorial Optimization Problems and Informatics
2015
|
| Subjects: | |
| Online Access: | https://www.redalyc.org/articulo.oa?id=265239212005 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866590196063010816 |
|---|---|
| author | Laura Cruz-Reyes |
| author_facet | Laura Cruz-Reyes |
| contents | Lower and Upper Bounds for the Master Bay Planning Problem Laura Cruz-Reyes Paula Hernández Hernández Patricia Melin Julio Mar-Ortiz Héctor Joaquín Fraire Huacuja Héctor José Puga Soberanes Juan Javier González Barbosa Computación Lower bound upper bound combinatorial optimization Master Bay Planning Problem 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. 2015 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265239212005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.6 |
| format | Artículo científico |
| id | redalyc_265239212005 |
| language | en |
| publishDate | 2015 |
| publisher | International Journal of Combinatorial Optimization Problems and Informatics |
| spellingShingle | Lower and Upper Bounds for the Master Bay Planning Problem Laura Cruz-Reyes Computación Lower bound upper bound combinatorial optimization Master Bay Planning Problem Lower and Upper Bounds for the Master Bay Planning Problem Laura Cruz-Reyes Paula Hernández Hernández Patricia Melin Julio Mar-Ortiz Héctor Joaquín Fraire Huacuja Héctor José Puga Soberanes Juan Javier González Barbosa Computación Lower bound upper bound combinatorial optimization Master Bay Planning Problem 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. 2015 artículo científico 2007-1558 https://www.redalyc.org/articulo.oa?id=265239212005 en http://www.redalyc.org/revista.oa?id=2652 International Journal of Combinatorial Optimization Problems and Informatics application/pdf International Journal of Combinatorial Optimization Problems and Informatics International Journal of Combinatorial Optimization Problems and Informatics (México) Num.1 Vol.6 |
| title | Lower and Upper Bounds for the Master Bay Planning Problem |
| topic | Computación Lower bound upper bound combinatorial optimization Master Bay Planning Problem |
| url | https://www.redalyc.org/articulo.oa?id=265239212005 |