In this work, we are looking at the problem of determining stowage plans for containerships. This problem, denoted in the literature as the Master Bay Plan Problem (MBPP), is computationally difficult to solve, that is NP-hard. We start from the optimal solution of subsets of bays related to independent portions of the ship, which are determined by a previously proposed decomposition approach for the MBPP; then, we look for the global ship stability of the overall stowage plan by using a tabu search (TS) metaheuristic approach. Note that at the same time the proposed TS algorithm allows us to further reduce the handling time of the containers to be loaded on the ship. The proposed heuristics has been implemented within a software support system that helps the planning management in the visualization of the stowage plans of each bay of the ship. Preliminary computational experimentations performed on some real life test cases related to a terminal located at the port of Genoa, Italy are provided.
|Titolo:||A new three step heuristic for the Master Bay Plan Problem|
|Data di pubblicazione:||2009|
|Appare nelle tipologie:||01.01 - Articolo su rivista|