Robust cyclic berth planning of container vessels
We consider a container terminal operator who faces the problem of constructing a cyclic berth plan. Such a plan defines the arrival and departure times of each cyclically calling vessel on a terminal, taking into account the expected number of containers to be handled and the necessary quay and crane capacity to do so. Conventional berth planning methods ignore the fact that, in practice, container terminal operator and shipping line agree upon an arrival window rather than an arrival time: if a vessel arrives within that window then a certain vessel productivity and hence departure time is guaranteed. The contributions of this paper are twofold. We not only minimize the peak loading of quay cranes in a port, but also explicitly take into account the arrival window agreements between the terminal operator and shipping lines. We present a robust optimization model for cyclic berth planning. Computational results on a real-world scenario for a container terminal in Antwerp show that the robust planning model can reach a substantial reduction in the crane capacity that is necessary to meet the window arrival agreements, as compared to a deterministic planning approach.
KeywordsContainer operations Berth planning Robustness Linear programming
This article is distributed under the terms of the Creative Commons Attribution Noncommercial License which permits any noncommercial use, distribution, and reproduction in any medium, provided the original author(s) and source are credited.
- Ball M, Barnhart C, Nemhauser G, Odoni A (2007) Air transportation: irregular operations and control. In: Barnhart C, Laporte G (eds) Handbooks in operations research and management science: transportation, chap 1. Elsevier, Amsterdam, pp 1–67Google Scholar
- Caimi G, Fuchsberger M, Laumanns M, Schüpbach K (2007) Periodic railway timetabling with event flexibility. In: Liebchen C, Ahuja R, Mesa J (eds) ATMOS—7th workshop on algorithmic approaches for transportation modeling, optimization and systems. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, pp 124–141Google Scholar
- Clausen J (2007) Disruption management in passenger transportation—from air to tracks. In: Liebchen C, Ahuja R, Mesa J (eds) ATMOS—7th workshop on algorithmic approaches for transportation modeling, optimization and systems. Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, pp 30–47Google Scholar
- Hansen P, Oğuz C, Mladenović N (2007) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res (in press)Google Scholar
- Hendriks M (2009) Multi-step optimization of logistics networks. strategic, tactical and operational decisions. Ph.D. thesis, Eindhoven University of TechnologyGoogle Scholar