A decomposition heuristics for the container ship stowage problem

Authors:
Daniela Ambrosino;Anna Sciomachen;Elena Tanfani
Affiliations:
Department of Economics and Quantitative Methods (DIEM), University of Genova, Genova, Italy 16126;Department of Economics and Quantitative Methods (DIEM), University of Genova, Genova, Italy 16126;Department of Economics and Quantitative Methods (DIEM), University of Genova, Genova, Italy 16126
Venue:
Journal of Heuristics
Year:
2006

Citing 5
Cited 4

Computerized container-ship load planning: a methodology and evaluation

Computers and Industrial Engineering
Exact and approximate solutions of the container ship stowage problem

Proceedings of the 15th annual conference on Computers and industrial engineering
Container ship stowage problem: complexity and connection to the coloring of circle graphs

Discrete Applied Mathematics
Principles of Combinatorial Optimization Applied to Container-Ship Stowage Planning

Journal of Heuristics
A Genetic Algorithm with a Compact Solution Encoding for the Container Ship Stowage Problem

Journal of Heuristics

Generating optimal stowage plans for container vessel bays

CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Berth allocation planning in Seville inland port by simulation and optimisation

Advanced Engineering Informatics
Applying the corridor method to a blocks relocation problem

OR Spectrum
An experimental comparison of different heuristics for the master bay plan problem

SEA'10 Proceedings of the 9th international conference on Experimental Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we face the problem of stowing a containership, referred to as the Master Bay Plan Problem (MBPP); this problem is difficult to solve due to its combinatorial nature and the constraints related to both the ship and the containers. We present a decomposition approach that allows us to assign a priori the bays of a containership to the set of containers to be loaded according to their final destination, such that different portions of the ship are independently considered for the stowage. Then, we find the optimal solution of each subset of bays by using a 0/1 Linear Programming model. Finally, we check the global ship stability of the overall stowage plan and look for its feasibility by using an exchange algorithm which is based on local search techniques. The validation of the proposed approach is performed with some real life test cases.