A survey of berth allocation and quay crane scheduling problems in container terminals

European Journal of Operational Research

Volumn 202, Issue 3, 2010, Pages 615-627

  Bierwirth, Christian ^a   Meisel, Frank ^a  

^a MARTIN LUTHER UNIVERSITY HALLE WITTENBERG   (Germany)

Author keywords

Berth allocation; Container terminal operations; Integrated planning; Problem classification; Quay crane assignment; Quay crane scheduling

Indexed keywords

BERTH ALLOCATION; CONTAINER TERMINAL OPERATIONS; INTEGRATED PLANNING; PROBLEM CLASSIFICATION; QUAY CRANE ASSIGNMENT; QUAY CRANE SCHEDULING;

CRANES; RAILROAD YARDS AND TERMINALS; TRANSFER CASES (VEHICLES);

PORT TERMINALS;

EID: 70350568773     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2009.05.031     Document Type: Article

References (114)

1. Ak, A., Erera, A.L., 2006. Simultaneous berth and quay crane scheduling for container ports, Working Paper, H. Milton Stewart School of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta.
2. Bierwirth, C., Meisel, F., 2009. A fast heuristic for quay crane scheduling with interference constraints. Journal of Scheduling, doi: 10.1007/s10951-009-0105-0.
3. Bish E.K. A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research 144 1 (2003) 83-107
4. Briano, C., Briano, E., Bruzzone, A.G., 2005. Models for support maritime logistics: a case study for improving terminal planning. In: Merkuryev, Y., Zobel, R., Kerckhoffs, E. (Eds.), Proceedings of the 19th European Conference on Modelling and Simulation (ECMS). pp. 199-203.
5. Brown G.G., Cormican K.J., Lawphongpanich S., and Widdis D. Optimizing submarine berthing with a persistence incentive. Naval Research Logistics 44 4 (1997) 301-318
6. Brown G.G., Lawphongpanich S., and Thurman K.P. Optimizing ship berthing. Naval Research Logistics 41 1 (1994) 1-15
7. Canonaco P., Legato P., Mazza R.M., and Musmanno R. A queuing network model for the management of berth crane operations. Computers and Operations Research 35 8 (2008) 2432-2446
8. Chang D., Yan W., Chen C.-H., and Jiang Z. A berth allocation strategy using heuristics algorithm and simulation optimisation. International Journal of Computer Applications in Technology 32 4 (2008) 272-281
9. Chen, C.-Y., Hsieh, T.-W., 1999. A time-space network model for the berth allocation problem. In: 19th IFIP TC7 Conference on System Modeling and Optimization, Cambridge.
10. Chen L., Bostel N., Dejax P., Cai J., and Xi L. A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 181 1 (2007) 40-58
11. Cheong, C.Y., Lin, C.J., Tan, K.C., Liu, D.K., 2007. A multi-objective evolutionary algorithm for berth allocation in a container port. In: IEEE Congress on Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington DC, pp. 927-934.
12. Cordeau J.-F., Laporte G., Legato P., and Moccia L. Models and tabu search heuristics for the berth-allocation problem. Transportation Science 39 4 (2005) 526-538
13. Crainic T.G., and Kim K.H. Intermodal transportation. Handbooks in Operations Research and Management Science vol. 14 (2007), Elsevier, Amsterdam pp. 467-537
14. Daganzo C.F. The crane scheduling problem. Transportation Research Part B 23 3 (1989) 159-175
15. Dai J., Lin W., Moorthy R., and Teo C.-P. Berth allocation planning optimization in container terminals. In: Tang C.S., Teo C.-P., and Wei K.-K. (Eds). Supply chain analysis: a handbook on the interaction of information. System and Optimization (2008), Springer, New York 69-105
16. Dolk D.R., and Kottemann J.E. Model integration and a theory of models. Decision Support Systems 9 1 (1993) 51-63
17. Dragovic B., Park N.K., and Radmilovic Z. Ship-berth link performance evaluation: simulation and analytical approaches. Maritime Policy and Management 33 3 (2006) 281-299
18. Dragovic B., Park N.K., Radmilovic Z., and Maras V. Simulation modelling of ship-berth link with priority service. Maritime Economics and Logistics 7 4 (2005) 316-335
19. Edmond E.D., and Maggs R.P. How useful are queue models in port investment decisions for container berths. Journal of the Operational Research Society 29 8 (1978) 741-750
20. Gambardella L.M., Mastrolilli M., Rizzoli A.E., and Zaffalon M. An optimization methodology for intermodal terminal management. Journal of Intelligent Manufacturing 12 5 (2001) 521-534
21. Geoffrion A. Structured modeling: survey and future research directions. Interactive Transactions of ORMS 1 2 (1999)
22. Giallombardo, G., Moccia, L., Salani, M., Vacca, I., 2008. The tactical berth allocation problem with quay crane assignment and transshipment-related quadratic yard costs. In: Proceedings of the European Transport Conference (ETC), pp. 1-27.
23. Goh, K.S., Lim, A., 2000. Combining various algorithms to solve the ship berthing problem. In: Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'00). IEEE Computer Society, Los Alamitos, CA, pp. 370-373.
24. Golias, M., Boile, M., Theofanis, S., 2006. The berth allocation problem: a formulation reflecting time window service deadlines. In: Proceedings of the 48th Transportation Research Forum Annual Meeting. Transportation Research Forum, Boston.
25. Golias, M., Boile, M., Theofanis, S., 2007. The stochastic berth allocation problem. In: Proceedings of the International Conference on Transport Science and Technology (TRANSTEC 2007). Czech Technical University, Prague, pp. 52-66.
26. Goodchild, A.V., 2006. Port planning for double cycling crane operations. In: Proceedings of the 85th Annual Meeting of Transportation Research Board (CD-ROM). Annual Meeting of Transportation Research Board. Washington DC.
27. Goodchild, A.V., Daganzo, C.F., 2004. Reducing Ship Turn-Around Time Using Double-Cycling, Research Report UCB-ITS-RR-2004-4, University of California, Berkeley.
28. Goodchild, A.V., Daganzo, C.F., 2005a. Crane double cycling in container ports: affect on ship dwell time, Research Report RR20055, University of California, Berkeley.
29. Goodchild, A.V., Daganzo, C.F., 2005b. Performance comparison of crane double-cycling strategies, Working Paper UCB-ITS-WP-2005-2, University of California, Berkeley.
30. Goodchild A.V., and Daganzo C.F. Double-cycling strategies for container ships and their effect on ship loading and unloading operations. Transportation Science 40 4 (2006) 473-483
31. Goodchild A.V., and Daganzo C.F. Crane double cycling in container ports: planning methods and evaluation. Transportation Research Part B 41 8 (2007) 875-891
32. Guan Y., and Cheung R.K. The berth allocation problem: models and solution methods. OR Spectrum 26 1 (2004) 75-92
33. Guan Y., Xiao W.-Q., Cheung R.K., and Li C.-L. A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis. Operations Research Letters 30 5 (2002) 343-350
34. Han, M., Li, P., Sun, J., 2006. The algorithm for berth scheduling problem by the hybrid optimization strategy GASA. In: Proceedings of the Ninth International Conference on Control, Automation, Robotics and Vision (ICARCV'06). IEEE Computer Society, Washington DC, pp. 1-4.
35. Hansen P., and Oǧuz C. A note on formulations of static and dynamic berth allocation problems. Les Cahiers du GERAD 30 (2003) 1-17
36. Hansen P., Oǧuz C., and Mladenovic N. Variable neighborhood search for minimum cost berth allocation. European Journal of Operational Research 191 3 (2008) 636-649
37. Hendriks, M.P.M., Laumanns, M., Lefeber, E., Udding, J.T., 2008. Robust periodic berth planning of container vessels. In: Kopfer, H., Gnnther, H.-O., Kim, K.H. (Eds.), Proceedings of the Third German-Korean Workshop on Container Terminal Management: IT-based Planning and Control of Seaport Container Terminals and Transportation Systems, pp. 1-13.
38. Henesey, L., Davidsson, P., Persson, J.A., 2004. Using simulation in evaluating berth allocation at a container terminal. In: Presented at Third International Conference on Computer Applications and Information Technology in the Maritime Industries (COMPIT'04), Siguënza, May 9-12.
39. Hoffarth, L., Voß, S., 1994. Berth allocation in a container terminal - development of a decision support system (in German). In: Dyckhoff, H., Derigs, U., Salomon, M., Tijms, H.C. (Eds.), Operations Research Proceedings 1993. Springer, Berlin et al., pp. 89-95.
40. Imai A., Chen H.C., Nishimura E., and Papadimitriou S. The simultaneous berth and quay crane allocation problem. Transportation Research Part E 44 5 (2008) 900-920
41. Imai A., Nagaiwa K., and Tat C.W. Efficient planning of berth allocation for container terminals in Asia. Journal of Advanced Transportation 31 1 (1997) 75-94
42. Imai A., Nishimura E., Hattori M., and Papadimitriou S. Berth allocation at indented berths for mega-containerships. European Journal of Operational Research 179 2 (2007) 579-593
43. Imai A., Nishimura E., and Papadimitriou S. The dynamic berth allocation problem for a container port. Transportation Research Part B 35 4 (2001) 401-417
44. Imai A., Nishimura E., and Papadimitriou S. Berth allocation with service priority. Transportation Research Part B 37 5 (2003) 437-457
45. Imai A., Nishimura E., and Papadimitriou S. Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E 44 1 (2008) 136-151
46. Imai A., Sasaki K., Nishimura E., and Papadimitriou S. Multi-objective simultaneous stowage and load planning for a container ship with container rehandle in yard stacks. European Journal of Operational Research 171 2 (2006) 373-389
47. Imai A., Sun X., Nishimura E., and Papadimitriou S. Berth allocation in a container port: using a continuous location space approach. Transportation Research Part B 39 3 (2005) 199-221
48. Imai A., Zhang J.-T., Nishimura E., and Papadimitriou S. The berth allocation problem with service time and delay time objectives. Maritime Economics and Logistics 9 4 (2007) 269-290
49. Johnson S. Optimal two- and three-stage production schedules with setup times. Naval Research Logistics Quarterly 1 1 (1954) 61-68
50. Jung, D.H., Park, Y.-M., Lee, B.K., Kim, K.H., Ryu, K.R., 2006. A quay crane scheduling method considering interference of yard cranes in container terminals. In: Gelbukh, A.F., García, C.A.R. (Eds.), Proceedings of the Fifth Mexican International Conference on Artificial Intelligence (MICAI 2006), vol. 4293 of LNCS. Springer, Berlin et al., pp. 461-471.
51. Kim, K.H., 2005. Models and methods for operations in port container terminals. In: Langevin, A., Riopel, D. (Eds.), Logistics systems: design and optimization. Gerad 25th Anniversary Series. Springer, Berlin et al., pp. 213-243.
52. Kim K.H., Kang J.S., and Ryu K.R. A beam search algorithm for the load sequencing of outbound containers in port container terminals. OR Spectrum 26 1 (2004) 93-116
53. Kim K.H., and Moon K.C. Berth scheduling by simulated annealing. Transportation Research Part B 37 6 (2003) 541-560
54. Kim K.H., and Park Y.M. A crane scheduling method for port container terminals. European Journal of Operational Research 156 3 (2004) 752-768
55. Lai K.K., and Shih K. A study of container berth allocation. Journal of Advanced Transportation 26 1 (1992) 45-60
56. Lee, D.-H., Song, L., Wang, H., 2006. Bilevel programming model and solutions of berth allocation and quay crane scheduling. In: Proceedings of 85th Annual Meeting of Transportation Research Board (CD-ROM). Annual Meeting of Transportation Research Board. Washington DC.
57. Lee, D.-H., Wang, H.Q., Miao, L., 2007. An approximation algorithm for quay crane scheduling with non-interference constraints in port container terminals. Presented at Tristan VI, Phuket, June 10-15.
58. Lee D.-H., Wang H.Q., and Miao L. Quay crane scheduling with non-interference constraints in port container terminals. Transportation Research Part E 44 1 (2008) 124-135
59. Lee D.-H., Wang H.Q., and Miao L. Quay crane scheduling with handling priority in port container terminals. Engineering Optimization 40 2 (2008) 179-189
60. Lee Y., and Chen C.-Y. An optimization heuristic for the berth scheduling problem. European Journal of Operational Research 196 2 (2008) 500-508
61. Lee Y.H., Kang J., Ryu K.R., and Kim K.H. Optimization of container load sequencing by a hybrid of ant colony optimization and tabu search. Lecture Notes in Computer Science 3611 (2005) 1259-1268
62. Legato, P., Gulli, D., Trunfio, R., 2008. The quay crane deployment problem at a maritime container terminal. In: Proceedings of the 22th European Conference on Modelling and Simulation (ECMS 2008), pp. 53-59.
63. Legato P., and Mazza R.M. Berth planning and resources optimisation at a container terminal via discrete event simulation. European Journal of Operational Research 133 3 (2001) 537-547
64. Li C.-L., Cai X., and Lee C.-Y. Scheduling with multiple-job-on-one-processor pattern. IIE Transactions 30 5 (1998) 433-445
65. Liang C., Huang Y., and Yang Y. A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Computers and Industrial Engineering 56 3 (2008) 1021-1028
66. Lim A. The berth planning problem. Operations Research Letters 22 2 (1998) 105-110
67. Lim, A., 1999. An effective ship berthing algorithm. In: Thomas, D. (Ed.), Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99-vol-1). Morgan Kaufmann Publishers, San Francisco, pp. 594-599.
68. Lim, A., Rodrigues, B., Xiao, F., Zhu, Y., 2002. Crane scheduling using tabu search. In: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI'02). IEEE Computer Society, Washington DC, pp. 146-153.
69. Lim A., Rodrigues B., Xiao F., and Zhu Y. Crane scheduling with spatial constraints. Naval Research Logistics 51 3 (2004) 386-406
70. Lim, A., Rodrigues, B., Xu, Z., 2004b. Approximation schemes for the crane scheduling problem. In: Hagerup, T., Katajainen, J. (Eds.), Ninth Scandinavian Workshop on Algorithm Theory (SWAT 2004), vol. 3111 of LNCS. Springer, Berlin et al., pp. 323-335.
71. Lim, A., Rodrigues, B., Xu, Z., 2004c. Solving the crane scheduling problem using intelligent search schemes (extended abstract). In: Wallace, M. (Ed.), 10th International Conference on Principles and Practice of Constraint Programming (CP 2004), vol. 3258 of LNCS. Springer, Berlin et al., pp. 747-751.
72. Lim A., Rodrigues B., and Xu Z. A m-parallel crane scheduling problem with a non-crossing constraint. Naval Research Logistics 54 2 (2007) 115-127
73. Liu J., Wan Y.-W., and Wang L. Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Research Logistics 53 1 (2006) 60-74
74. Lokuge, P., Alahakoon, D., 2004. Hybrid BDI agents with improved learning capabilities for adaptive planning in a container terminal application. In: Proceedings of the International Conference on Intelligent Agent Technology (IAT'04). IEEE Computer Society, Los Alamitos, pp. 120-126.
75. Lokuge, P., Alahakoon, D., 2005. Reinforcement learning in neuro BDI agents for achieving agent's intentions in vessel berthing applications. In: Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA'05). IEEE Computer Society, Los Alamitos, pp. 681-686.
76. Lokuge P., and Alahakoon D. Improving the adaptability in automated vessel scheduling in container ports using intelligent software agents. European Journal of Operational Research 177 3 (2007) 1985-2015
77. Lokuge, P., Alahakoon, D., Dissanayake, P., 2004. Collaborative neuro-BDI agents in container terminals. In: Proceedings of the 18th International Conference on Advanced Information Networking and Applications (AINA'04). IEEE Computer Society, Los Alamitos, pp. 155-158.
78. Mauri, G.R., Oliveira, A.C.M., Lorena, L.A.N., 2008. A hybrid column generation approach for the berth allocation problem. In: van Hemert, J., Cotta, C. (Eds.), Eighth European Conference on Evolutionary Computation in Combinatorial Optimisation (EvoCOP 2008), vol. 4972 of LNCS. Springer, Berlin et al., pp. 110-122.
79. Meersmans, P.J.M., Dekker, R., 2001. Operations research supports container handling. Econometric Institute Report 234, Erasmus University Rotterdam.
80. Meier L., and Schumann R. Coordination of interdependent planning systems, a case study. In: Koschke R., Otthein H., Rödiger K.-H., and Ronthaler M. (Eds). Lecture Notes in Informatics (LNI) P-109 (2007), Köllen Druck+Verlag GmbH, Bonn 389-396
81. Meisel, F., 2009. Seaside Operations Planning in Container Terminals. Physica, Berlin et al.
82. Meisel, F., Bierwirth, C., 2006. Integration of berth allocation and crane assignment to improve the resource utilization at a seaport container terminal. In: Haasis, H.-D., Kopfer, H., Schönberger, J. (Eds.), Operations Research Proceedings 2005. Springer, Berlin et al., pp. 105-110.
83. Meisel F., and Bierwirth C. Heuristics for the integration of crane productivity in the berth allocation problem. Transportation Research Part E 45 1 (2009) 196-209
84. Meisel F., and Bierwirth C. The berth allocation problem with a cut-and-run option. In: Fleischmann B., Borgwardt K.H., Klein R., and Tuma A. (Eds). Operations Research Proceedings 2008 (2009), Springer, Berlin et al. 283-288
85. Meisel, F., Wichmann, M., 2008. Container sequencing for quay cranes with internal reshuffles, Working Paper, Martin-Luther-University, Halle-Wittenberg.
86. Moccia L., Cordeau J.-F., Gaudioso M., and Laporte G. A branch-and-cut algorithm for the quay crane scheduling problem in a container terminal. Naval Research Logistics 53 1 (2006) 45-59
87. Monaco M.F., and Sammarra M. The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transportation Science 41 2 (2007) 265-280
88. Moon, K., 2000. A mathematical model and a heuristic algorithm for berth planning. Ph.D. Thesis, Pusan National University, Pusan.
89. Moorthy R., and Teo C.-P. Berth management in container terminal: the template design problem. OR Spectrum 28 4 (2006) 495-518
90. Muhanna, W., Pick, R., 1988. Composite models in SYMMS. In: Proceedings 21st Annual Hawaii International Conference on System Sciences (HICSS 21), vol. 3. IEEE Computer Society, Washington DC, pp. 418-427.
91. Ng W.C., and Mak K.L. Quay crane scheduling in container terminals. Engineering Optimization 38 6 (2006) 723-737
92. Nishimura E., Imai A., and Papadimitriou S. Berth allocation planning in the public berth system by genetic algorithms. European Journal of Operational Research 131 2 (2001) 282-292
93. Oǧuz, C., Błażewicz, J., Cheng, T.C.E., Machowiak, M., 2004. Berth allocation as a moldable task scheduling problem. In: Proceedings of the Ninth International Workshop on Project Management and Scheduling (PMS 2004). Nancy, pp. 201-205.
94. Park K.T., and Kim K.H. Berth scheduling for container terminals by using a sub-gradient optimization technique. Journal of the Operational Research Society 53 9 (2002) 1054-1062
95. Park Y.M., and Kim K.H. A scheduling method for berth and quay cranes. OR Spectrum 25 1 (2003) 1-23
96. Peterkofsky R.I., and Daganzo C.F. A branch and bound solution method for the crane scheduling problem. Transportation Research Part B 24 3 (1990) 159-172
97. Pinedo M. Scheduling - Theory Algorithms and Systems. 2nd ed. (2002), Prentice-Hall, Englewood Cliffs, NJ
98. Rashidi, H., 2006. Dynamic scheduling of automated guided vehicles. Ph.D. Thesis, University of Essex, Colchester.
99. Sammarra M., Cordeau J.-F., Laporte G., and Monaco M.F. A tabu search heuristic for the quay crane scheduling problem. Journal of Scheduling 10 4-5 (2007) 327-336
100. Schonfeld P., and Frank S. Optimizing the use of a containership berth. Transportation Research Record 984 (1984) 56-62
101. Stahlbock R., and Voß S. Operations research at container terminals: a literature update. OR Spectrum 30 1 (2008) 1-52
102. Steenken D., Voß S., and Stahlbock R. Container terminal operation and operations research - a classification and literature review. OR Spectrum 26 1 (2004) 3-49
103. Steenken D., Winter T., and Zimmermann U.T. Stowage and transport optimization in ship planning. In: Grötschel M., Krumke S., and Rambau J. (Eds). Online Optimization of Large Scale Systems (2001), Springer, Berlin 731-745
104. Tavakkoli-Moghaddam R., Makui A., Salahi S., Bazzazi M., and Taheri F. An efficient algorithm for solving a new mathematical model for a quay crane scheduling problem in container ports. Computers and Industrial Engineering 56 1 (2009) 241-248
105. Theofanis, S., Boile, M., Golias, M., 2007a. An optimization based genetic algorithm heuristic for the berth allocation problem. IEEE Congress on Evolutionary Computation 2007 (CEC 2007). IEEE Computer Society, Washington DC, pp. 4439-4445.
106. Theofanis, S., Golias, M., Boile, M., 2007b. Berth and quay crane scheduling: a formulation reflecting service deadlines and productivity agreements. In: Proceedings of the International Conference on Transport Science and Technology (TRANSTEC 2007). Czech Technical University, Prague, pp. 124-140.
107. Tong, C.J., Lau, H.C., Lim, A., 1999. Ant colony optimization for the ship berthing problems. In: Thiagarajan, P.S., Yap, R. (Eds.), Fifth Asian Computing Science Conference (ASIAN'99), vol. 1742 of LNCS. Springer, Berlin et al., pp. 359-370.
108. Vacca, I., Bierlaire, M., Salani, M., 2007. Optimization at container terminals: Status, trends and perspectives. In: Proceedings of the Swiss Transport Research Conference (STRC). Monte Veritá/Ascona, pp. 1-21.
109. Vis I.F.A., and de Koster R. Transshipment of containers at a container terminal: an overview. European Journal of Operational Research 147 1 (2003) 1-16
110. Wang F., and Lim A. A stochastic beam search for the berth allocation problem. Decision Support Systems 42 4 (2007) 2186-2196
111. Winter, T., 1999. Online and real-time dispatching problems. Ph.D. Thesis, Technical University Braunschweig.
112. Zhang H., and Kim K.H. Maximizing the number of dual-cycle operations of quay cranes in container terminals. Computers and Industrial Engineering 56 3 (2009) 979-992
113. Zhou, P., Kang, H., Lin, L., 2006. A dynamic berth allocation model based on stochastic consideration. In: Proceedings of the Sixth World Congress on Intelligent Control and Automation (WCICA 2006), vol. 2. IEEE Computer Society, Washington DC, pp. 7297-7301.
114. Zhu Y., and Lim A. Crane scheduling with non-crossing constraint. Journal of the Operational Research Society 57 12 (2006) 1464-1471