Simultaneous berth allocation and yard planning at tactical level

OR Spectrum

Volumn 35, Issue 2, 2013, Pages 441-456

  Hendriks, M P M ^a   Lefeber, E ^a   Udding, J T ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Alternating optimization; Berth allocation; Linear programming; Yard planning

Indexed keywords

EID: 84874020639     PISSN: 01716468     EISSN: 14366304     Source Type: Journal    
DOI: 10.1007/s00291-012-0305-4     Document Type: Article

References (24)

1. Bierwirth C, Meisel F (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. Eur J Oper Res 202: 615-627.
2. Brimberg J, Hansen P, Mladenović N, Salhi S (2008) A survey of solution methods for the continuous location-allocation problem. Int J Oper Res 5: 1-12.
3. Cooper L (1964) The transportation-location problem. SIAM Rev 6: 37-53.
4. Cordeau J-F, Gaudioso M, Laporte G, Moccia L (2007) The service allocation problem at the Gioia Tauro maritime terminal. Eur J Oper Res 176: 1167-1184.
5. Cordeau J-F, Laporte G, Legato P, Moccia L (2005) Models and Tabu search heuristics for the berth-allocation problem. Transp Sci 39: 526-538.
6. Giallombardo G, Moccia L, Salani M, Vacca I (2010) Modeling and solving the tactical berth allocation problem. Transp Res Part B 44: 232-245.
7. Han Y, Lee LH, Chew EP, Tan KC (2008) A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr 30: 697-720.
8. Hendriks MPM (2009) Multi-step optimization of logistics networks strategic, tactical, and operational descisions. PhD Thesis, Eindhoven University of Technology, Eindhoven, The Netherlands.
9. Hendriks MPM, Armbruster D, Laumanns M, Lefeber E, Udding JT (2012) Strategic allocation of cyclically calling vessels for multi-terminal container operators. Flex Serv Manuf J 24: 248-273.
10. Hendriks MPM, Laumanns M, Lefeber E, Udding JT (2010) Robust cyclic berth planning of container vessels. OR Spectr 32: 501-517.
11. Imai A, Nishimura E, Hattori M, Papadimitriou S (2007) Berth allocation at indented berths for mega-containerships. Eur J Oper Res 179: 579-593.
12. Imai A, Nishimura E, Papadimitriou S (2005) Berth allocation in a container port: using a continuous location space approach. Transp Res Part B 39: 199-221.
13. Kim KH, Park KT (2003a) Dynamic space allocation for temporary storage. Int J Syst Sci 34: 11-20.
14. Kim KH, Park KT (2003b) A note on a dynamic space-allocation method for outbound containers. Eur J Oper Res 148: 92-101.
15. Kim KH, Park Y-M, Jin M-J (2008) An optimal layout of container yards. OR Spectr 30: 675-695.
16. Kim KH, Moon KC (2003) Berth scheduling by simulated annealing. Trans Res Part B 37: 541-560.
17. Lee LH, Chew EP, Tan KC, Han Y (2006) An optimization model for storage yard management in transshipment hubs. OR Spectr 28: 539-561.
18. Moccia L, Cordeau J-F, Monaco MF, Sammarra M (2009) A column generation heuristic for a dynamic generalized assignment problem. Comput Oper Res 36: 2670-2681.
19. Monaco MF, Sammarra M (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Trans Sci 41: 265-280.
20. Moorthy R, Teo C-P (2006) Berth management in container terminal: the template design problem. OR Spectr 28: 495-518.
21. 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.
22. Stahlbock R, Voß S (2008) Operations research at container terminals: a literature update. OR Spectr 30: 1-52.
23. Wang FW, Lim A (2007) A stochastic beam search for the berth allocation problem. Decis Support Syst 42: 2186-2196.
24. Zhang C, Liu J, Wan Y-W, Murthy KG, Linn RJ (2003) Storage space allocation in container terminals. Trans Res Part B 37: 883-903.