Servicios Personalizados
Revista
Articulo
Indicadores
- Citado por SciELO
- Accesos
Links relacionados
- Similares en SciELO
Compartir
International Journal of Combinatorial Optimization Problems and Informatics
versión On-line ISSN 2007-1558
Resumen
CRUZ-REYES, Laura et al. Lower and Upper Bounds for the Master Bay Planning Problem. International J. of Combinatorial Optim. Problems and Informatics [online]. 2015, vol.6, n.1, pp.42-52. ISSN 2007-1558.
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.
Palabras llave : Lower bound; upper bound; Master Bay Planning Problem; combinatorial optimization.