Robust cyclic berth planning of container vessels

OR Spectrum

Volumn 32, Issue 3, 2010, Pages 501-517

  Hendriks, Maarten ^a   Laumanns, Marco ^b   Lefeber, Erjen ^a   Udding, Jan Tijmen ^a,c  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b ETH ZURICH   (Switzerland)

^c PSA HNN   (Belgium)

Author keywords

Berth planning; Container operations; Linear programming; Robustness

Indexed keywords

EID: 77953534288     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-010-0198-z     Document Type: Article

References (18)

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.
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.
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.
14. Moorthy R, Teo C (2006) Berth management in container terminal: the template design problem. OR Spectr 28(4): 495-518.
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.
16. Park YM, Kim KH (2003) A scheduling method for berth and quay cranes. OR Spectr 25: 1-23.
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.