Tactical berth and yard template design at container transshipment terminals: A column generation based approach

Transportation Research Part E: Logistics and Transportation Review

Volumn 73, Issue , 2015, Pages 168-184

  Jin, Jian Gang ^a   Lee, Der Horng ^b   Hu, Hao ^a  

^a Shanghai Jiao Tong University   (China)

^b NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

Author keywords

Berth template; Container terminal; Port congestion; Storage allocation; Transshipment; Yard template

Indexed keywords

HEURISTIC METHODS; LINEAR PROGRAMMING; TRAFFIC CONGESTION;

BERTH TEMPLATE; COLUMN GENERATION; CONTAINER TERMINAL; PORT CONGESTION; QUAY-SIDE; STORAGE ALLOCATION; TACTICALS; TEMPLATE DESIGNS; TRANSSHIPMENT; YARD TEMPLATE;

CONTAINERS;

CONTAINER TERMINAL; DESIGN; EFFICIENCY MEASUREMENT; NUMERICAL MODEL; PLANNING METHOD; PORT OPERATION; SHIPPING; TRAFFIC CONGESTION; TRAFFIC MANAGEMENT;

EID: 84919952372     PISSN: 13665545     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tre.2014.11.009     Document Type: Article

References (31)

1. Bierwirth C., Meisel F. A survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res. 2010, 202(3):615-627.
2. Cordeau J.F., Gaudioso M., Laporte G., Moccia L. The service allocation problem at the Giola Tauro maritime terminal. Eur. J. Oper. Res. 2007, 176(2):1167-1184.
3. Cordeau J.F., Laporte G., Legato P., Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transp. Sci. 2005, 39(4):526-538.
4. Fan L., Wilson W.W., Dahl B. Congestion, port expansion and spatial competition for us container imports. Transp. Res. Part E 2012, 48(6):1121-1136.
5. Giallombardo G., Moccia L., Salani M., Vacca I. Modeling and solving the tactical berth allocation problem. Transp. Res. Part B 2010, 44(2):232-245.
6. Guan Y.P., Cheung R.K. The berth allocation problem: Models and solution methods. OR Spectr. 2004, 26(1):75-92.
7. Han Y., Lee L.H., Chew E.P., Tan K.C. A yard storage strategy for minimizing traffic congestion in a marine container transshipment hub. OR Spectr. 2008, 30(4):697-720.
8. Hendriks M.P.M., Lefeber E., Udding J.T. Simultaneous berth allocation and yard planning at tactical level. OR Spectr. 2013, 35(2):441-456.
9. Imai A., Nishimura E., Papadimitriou S. The dynamic berth allocation problem for a container port. Transp. Res. Part B 2001, 35(4):401-417.
10. Imai A., Yamakawa Y., Huang K. The strategic berth template problem. Transp. Res. Part E 2014, 72:77-100.
11. Kim K.H., Moon K.C. Berth scheduling by simulated annealing. Transp. Res. Part B 2003, 37(6):541-560.
12. Lee D.-H., Jin J.G. Feeder vessel management at container transshipment terminals. Transp. Res. Part E 2013, 49(1):201-216.
13. Lee D.-H., Jin J.G., Chen J.H. Schedule template design and storage allocation for cyclically visiting feeders in container transshipment hubs. Transp. Res. Rec.: J. Transp. Res. Board 2012, 2273(1):87-95.
14. Lim A. The berth planning problem. Oper. Res. Lett. 1998, 22(2-3):105-110.
15. Moccia, L., Astorino, A. 2007. The group allocation problem in a transshipment container terminal. In: Proceedings of World Conference on Transport Research. University of California at Berkeley.
16. Moccia L., Cordeau J.F., Monaco M.F., Sammarra M. A column generation heuristic for a dynamic generalized assignment problem. Comput. Oper. Res. 2009, 36(9):2670-2681.
17. Monaco M.F., Moccia L., Sammarra M. Operations research for the management of a transhipment container terminal: The Gioia Tauro case. Maritime Econ. Logist. 2009, 11(1):7-35.
18. Moorthy R., Teo C.P. Berth management in container terminal: The template design problem. OR Spectr. 2006, 28(4):495-518.
19. MPA Singapore, 2014. Port Statistics. (accessed: 11th Aug 2014).
20. Ng W.C., Mak K.L., Li M.K. Yard planning for vessel services with a cyclical calling pattern. Eng. Optim. 2010, 42(11):1039-1054.
21. Paul J.A., Maloni M. Evaluating capacity options for the north american west coast container ports. Transp. J. 2013, 52:52-79.
22. Stahlbock R., Voss S. Operations research at container terminals: A literature update. OR Spectr. 2008, 30(1):1-52.
23. Steenken D., Voss S., Stahlbock R. Container terminal operation and operations research - A classification and literature review. OR Spectr. 2004, 26(1):3-49.
24. Talley W.K. An economic theory of the port. Res. Transp. Econ. 2006, 16:43-65.
25. Vacca, I., Bierlaire, M., Salani, M., 2007. Optimization at container terminals: Status, trends and perspectives. Tech. Rep. TRANSP-OR 071204, Transport and Mobility Laboratory, EPFL.
26. Vacca I., Salani M., Bierlaire M. An exact algorithm for the integrated planning of berth allocation and quay crane assignment. Transp. Sci. 2013, 47(2):148-161.
27. Wang F., Lim A. A stochastic beam search for the berth allocation problem. Decis. Support Syst. 2007, 42(4):2186-2196.
28. Wang S., Alharbi A., Davy P. Liner ship route schedule design with port time windows. Transp. Res. Part C 2014, 41:1-17.
29. Zhang C., Liu J., Wan Y.-W., Murty K.G., Linn R.J. Storage space allocation in container terminals. Transp. Res. Part B 2003, 37(10):883-903.
30. Zhen L. Yard template planning in transshipment hubs under uncertain berthing time and position. J. Oper. Res. Soc. 2012, 64(9):1418-1428.
31. Zhen L., Chew E.P., Lee L.H. An integrated model for berth template and yard template planning in transshipment hubs. Transp. Sci. 2011, 45(4):483-504.