No abstract

The berth allocation problem is one of the most relevant logistics problems arising in the management of container ports. Depending on assumptions made on the berthing location policy, two classes of the berth allocation problem have been considered in literature: the discrete case and the continuous case. In this paper, the properties of the discrete berth allocation problem, formulated as a dynamic scheduling problem, are analyzed. A new formulation of the problem is proposed, which is shown to be more compact and stronger than another one from the literature; a Lagrangean heuristic algorithm is developed; and computational results are presented.

No abstract

No abstract

In this work we describe some decisional problems arising in the management of maritime container ports, together with optimisation models and algorithms suitably designed for their solution. We refer to the Gioia Tauro container terminal which recently has reached a high stage of growth, becoming one of the most important transhipment ports in the Mediterranean Sea. In particular, we focus on quay-side problems (berth allocation and quay crane scheduling), yard-side problems (tactical and operational yard management), vehicle routing problems and human resources management problems. The common final aim, in facing the above problems, is to improve the efficiency, and thus the competitiveness of the container terminal. Maritime Economics & Logistics (2009) 11, 7–35. doi:10.1057/mel.2008.21