Lower and Upper Bounds for the Master Bay Planning Problem

  • Laura Cruz-Reyes Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero
  • Paula Hernández Hernández Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero
  • Patricia Melin Tecnológico Nacional de México, Instituto Tecnológico de Tijuana
  • Julio Mar-Ortiz Universidad Autónoma de Tamaulipas
  • Héctor Joaquín Fraire Huacuja Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero
  • Héctor José Puga Soberanes Tecnológico Nacional de México, Instituto Tecnológico de León
  • Juan Javier González Barbosa Tecnológico Nacional de México, Instituto Tecnológico de Ciudad Madero
Keywords: 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.

Published
2015-01-18
How to Cite
Cruz-Reyes, L., Hernández Hernández, P., Melin, P., Mar-Ortiz, J., Fraire Huacuja, H., Puga Soberanes, H., & González Barbosa, J. (2015). Lower and Upper Bounds for the Master Bay Planning Problem. International Journal of Combinatorial Optimization Problems and Informatics, 6(1), 42-52. Retrieved from https://ijcopi.org/index.php/ojs/article/view/61
Section
Articles