Analysis of berth allocation and inspection operations in a container terminal

Maritime Economics and Logistics

Volumn 12, Issue 4, 2010, Pages 347-369

  Guan, Yongpei ^a   Yang, Kang Hung ^b  

^a University of Florida   (United States)

^b CHUNG YUAN CHRISTIAN UNIVERSITY   (Taiwan)

Author keywords

container terminal operation; inspection operation; simulation; worst case analysis

Indexed keywords

EID: 78649523099     PISSN: 14792931     EISSN: 1479294X     Source Type: Journal    
DOI: 10.1057/mel.2010.12     Document Type: Article

References (35)

1. Ak, A. and Erera, A.L. (2007) Simultaneous Berth and Quay Crane Scheduling for Container Ports. H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta. Working Paper.
2. Ballis, A., Dimitriou, L. and Paravantis, J. (2010) Quay to storage area container transfer: Critical review of modeling techniques and practical outcomes. Proceedings of the 2010 Annual Meeting of the Transportation Research Board, Paper #10-3020, Washington DC, CD ROM.
3. Banks, J. (1998) The future of simulation software: A panel discussion. Proceedings of the 1998 Winter Simulation Conference, CD ROM, pp. 1681-1687.
4. Bierwirth, C. and Meisel, F. (2010) A survey of berth allocation and quay crane scheduling problems in container terminals. European Journal of Operational Research 202: 615-627.
5. Cordeau, J.F., Laporte, G., Legato, P. and Moccia, L. (2005) Models and Tabu search heuristics for the berth-allocation problem. Transportation Science 39: 526-538.
6. Daganzo, C.F. (1989) The crane scheduling problem. Transportation Research B 23(3): 159-175.
7. Drozdowski, M. (1996) Scheduling multiprocessor tasks - An overview. European Journal of Operational Research 94: 215-230.
8. Gerencser, M., Weinberg, J. and Vincent, J. (2003) Port Security Wargame Implications for U.S. Supply Chain. Booze Allen Hamilton. Technical Report.
9. Guan, Y. and Cheung, R.K. (2004) The berth allocation problem: Models and solution methods. Operations Research Spectrum 26: 75-92.
10. Guan, Y., Xiao, W.Q., Cheung, R.K. and Li., C.L. (2002) A multiprocessor task scheduling model for berth allocation: Heuristic and worst-case analysis. Operations Research Letters 30: 343-350.
11. Hansen, P., Oguz, C. and Mladenovic, N. (2008) Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 191: 636-649.
12. Hartmann, S. (2004) Generating scenarios for simulation and optimization of container terminal logistics. OR Spectrum 26: 171-192.
13. Imai, A., Chen, H.C., Nishimura, E. and Papadimitriou, S. (2008) The simultaneous berth and quay crane allocation problem. Transportation Research E 44: 900-920.
14. Imai, A., Nishimura, E., Hattori, M. and Papadimitriou, S. (2007) Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 179: 579-593.
15. Imai, A., Sun, X., Nishimura, E. and Papadimitriou, S. (2005) Berth allocation in a container port: Using a continuous location space approach. Transportation Research B 39: 199-221.
16. Kim, K.H. and Moon, K.C. (2003) Berth scheduling by simulated annealing. Transportation Research B 37: 541-560.
17. Lee, Y. and Chen, C.Y. (2009) An optimization heuristic for the berth scheduling problem. European Journal of Operational Research 196: 500-508.
18. Li, C.L., Cai, X. and Lee., C.Y. (1998) Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30: 433-445.
19. Lim, A., Rodrigues, B., Xiao, F. and Zhu, Y. (2004) Crane scheduling with spatial constraints. Naval Research Logistics 51: 386-406.
20. Lim, A., Rodrigues, B. and Xu, Z. (2007) An M-parallel crane scheduling problem with a noncrossing constraint. Naval Research Logistics 54: 115-127.
21. Lun, Y.H.V., Wong, C.W.Y., Lai, K.H. and Cheng, T.C.E. (2008) Institutional perspective on the adoption of technology for the security enhancement of container transport. Transport Reviews 28: 21-33.
22. Meisel, F. (2009) Seaside operations planning in container terminals. Physica-Verlag Berlin Heidelberg, doi. 10.1007/978-3-7908-2191-8.
23. Meisel, F. and Bierwirth, C. (2009) Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 45: 196-209.
24. Monaco, M.F. and Sammarra, M. (2007) The berth allocation problem: A strong formulation solved by a Lagrangean approach. Transportation Science 41(2): 265-280.
25. Moorthy, R. and Teo, C.P. (2006) Berth management in container terminal: The template design problem. OR Spectrum 28: 495-518.
26. Park, Y.M. and Kim, K.H. (2003) A scheduling method for berth and quay cranes. OR Spectrum 25: 1-23.
27. Peterkofsky, R.I. and Daganzo, C.F. (1990) A branch and bound solution method for the crane scheduling problem. Transportation Research B 24(3): 159-172.
28. Roach, A. (2003) Container and port security: A bilateral perspective. The International Journal of Marine and Coastal Law 18(3): 341-361.
29. Sekine, S., Campos-Nanez, E., Harrald, J.R. and Abeledo, H. (2006) A simulation-based approach to trade-off analysis of port security. Proceedings of the 2006 Winter Simulation Conference, CD ROM, pp. 521-528.
30. Simchi-Levi, D., Laminsky, P. and Simchi-Levi, E. (2002) Designing and Managing the Supply Chain, 2nd edn. Burr Ridge, IL, USA: McGraw-Hill/Irwin.
31. Steenken, D., Vob, S. and Stahlbock, R. (2004) Container terminal operation and operations research - A classification and literature review. OR Spectrum 26: 3-49.
32. Stahlbock, R. and Vob, S. (2008) Operations research at container terminals: A literature update. OR Spectrum 30: 1-52.
33. Thibault, M., Brooks, M.R. and Button, K.J. (2006) The response of the U.S. maritime industry to the new container security initiatives. Transportation Journal 45: 5-15.
34. Wang, F. and Lim, A. (2007) A stochastic beam search for the berth allocation problem. Decision Support Systems 42: 2186-2196.
35. Willis, H.H. and Ortiz, D.S. (2004) Evaluating the Security of the Global Containerized Supply Chain. RAND. Technical Report.