Optimization of Container Storage under Reshuffling Constraints in a Seaport

Abstract

This contribution presents a mathematical model that manages container storage at the beginning of a time horizon, in a container terminal, ignoring incoming containers. For the solution of this static case of the container storage problem, a mathematical representation of the problem as an integer linear program will be studied. The objective is to minimize the expected total distance between storage locations and their exits, considering the shuffling constraints. A complexity analysis of the problem has been performed, and then graph theory notions has been employed by reducing the problem to incompatibility graphs that make the storage constraints more clearly visible. An application on a computer solver will then be performed on small instances.