Robust cyclic berth planning of container vessels.

*(English)*Zbl 1201.90027Summary: 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.

##### MSC:

90B06 | Transportation, logistics and supply chain management |

90C08 | Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) |

PDF
BibTeX
XML
Cite

\textit{M. Hendriks} et al., OR Spectrum 32, No. 3, 501--517 (2010; Zbl 1201.90027)

Full Text:
DOI

##### References:

[1] | 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–67 |

[2] | Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1): 35–53 · Zbl 1165.90565 |

[3] | 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–141 |

[4] | 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–47 |

[5] | Cordeau JF, Laporte G, Legato P, Motta L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39: 526–538 |

[6] | Hansen P, Oğuz C, Mladenović N (2007) Variable neighborhood search for minimum cost berth allocation. Eur J Oper Res (in press) |

[7] | Hendriks M (2009) Multi-step optimization of logistics networks. strategic, tactical and operational decisions. Ph.D. thesis, Eindhoven University of Technology |

[8] | Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. Transp Res B 35: 401–417 |

[9] | Imai A, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res B 39: 199–221 |

[10] | Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179: 579–593 · Zbl 1114.90004 |

[11] | Kim KW, Moon KC (2003) Berth scheduling by simulated annealing. Transp Res B 37: 541–560 |

[12] | Lan S, Clarke J, Barnhart C (2006) Planning for robust airline operations: optimizing aircraft routings and flight departure times to minimize passenger disruptions. Transp Sci 40(1): 15–28 |

[13] | Lim A (1998) The berth planning problem. Oper Res Lett 22: 105–110 · Zbl 0911.90283 |

[14] | Moorthy R, Teo C (2006) Berth management in container terminal: the template design problem. OR Spectr 28(4): 495–518 · Zbl 1098.90510 |

[15] | Nishimura E, Imai A, Papadimitriou S (2001) Berth allocation planning in the public berth system by genetic algorithms. Eur J Oper Res 131: 282–292 · Zbl 0991.90074 |

[16] | Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectr 25: 1–23 · Zbl 1012.90011 |

[17] | Vromans M, Dekker R, Kroon L (2007) Cyclic railway timetabling: a stochastic optimization approach. Lect Notes Comput Sci 4359: 41–66 |

[18] | Wang F, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42: 2186–2196 |

This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.