Author(s)

D. Ambrosino & A. Sciomachen

Abstract

: In this paper we deal with the so-called Master Bay Plan (MBP) Problem, that is the problem of stowing a given set of containers of different types into the available cells of a containership, while not violating some structural and operational constraints. We analyse in details the above constraints and present a Constraint Satisfaction Programming (CSP) approach for defining this combinatorial problem and finding good feasible solutions, with respect to some optimisation criteria. 1. Introduction and problem definition The stowage of a containership is one of the problem that has to be solved daily by any company which manages a terminal container [1,7]. This problem, usually denoted Master Bay Plan (MBP), consists in determining where to s

Keywords