×

On the berth allocation problem. (English) Zbl 1351.90021

Summary: The rapid growth of the maritime industry has created a need for improvement in container terminal operations, by effectively utilizing the available resources. One of the most important seaside planning problems that has received considerable attention in the literature is the assignment of quay space to vessels, commonly referred to as the Berth Allocation Problem (BAP). Despite the significant contributions to the BAP found in the literature, there are certain important requirements that have not been considered. These include vessels of different sizes, suitability of a berth to a vessel, known as service requirement, and the possibility for one vessel to be accommodated by more than one berth. Thus, we formulate a mixed integer program (MIP) that explicitly considers these factors, in order to produce more realistic results. The model assumes that the quay is partitioned into berths of the same size and that several berths can be assigned to one vessel, given that the vessel is too long to be accommodated by a single berth. Considering the possibility of occupation of several berths by one vessel implies that the sequence of berths occupied is valid and feasible. In addition, we consider two extensions; the first extension of the model accounts for the different service requirements of each vessel, while the second assumes different berth lengths. A preliminary computational analysis is conducted to test the effectiveness of the proposed models and provide useful insights to port operators.

MSC:

90B06 Transportation, logistics and supply chain management
90B35 Deterministic scheduling theory in operations research
90C11 Mixed integer programming
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] N. Al-Dhaheri and A. Diabat, The Quay Crane Scheduling Problem. J. Manuf. Syst.36 (2015) 87-94. · Zbl 1357.90046 · doi:10.1016/j.jmsy.2015.02.010
[2] N. Al-Dhaheri and A. Diabat, A Lagrangian-relaxation-based heuristic for the multiship quay crane scheduling problem with ship stability constraints. To appear in Ann. Oper. Res. (2016). · Zbl 1357.90046
[3] N. Al-Dhaheri, A. Jebali and A. Diabat, The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Comput. Ind. Eng.94 (2016) 230-244. · doi:10.1016/j.cie.2016.01.011
[4] N. Al-Dhaheri, A. Jebali and A. Diabat, A simulation based Genetic Algorithm approach for the Quay Crane Scheduling under uncertainty. Simul. Model. Pract. Theory66 (2016) 122-138. · doi:10.1016/j.simpat.2016.01.009
[5] J. Al Hammadi and A. Diabat, An Integrated Berth Allocation and Yard Assignment Problem for Bulk Ports: Formulation and Case Study. To appear in RAIRO: RO (2016). · Zbl 1358.90014
[6] C. Bierwirth and F. Meisel, A follow-up survey of berth allocation and quay crane scheduling problems in container terminals. Eur. J. Oper. Res.244 (2015) 675-689. · Zbl 1346.90326 · doi:10.1016/j.ejor.2014.12.030
[7] A. Diabat and E. Theodorou, An Integrated Quay Crane Assignment and Scheduling Problem. Comput. Ind. Eng.73 (2014) 115-123. · doi:10.1016/j.cie.2013.12.012
[8] Y. Du, Q. Chen, X. Quan, L. Long and R.Y.K. Fung, Berth allocation considering fuel consumption and vessel emissions. Transp. Res. Part E Logist. Transp. Rev.47 (2011) 1021-1037. · doi:10.1016/j.tre.2011.05.011
[9] Y.-M. Fu and A. Diabat, A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model.39 (2015) 1194-1201. · doi:10.1016/j.apm.2014.07.006
[10] Y.-M. Fu, A. Diabat and I.-T. Tsai, A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach. Expert Syst. Appl.41 (2014) 6959-6965. · doi:10.1016/j.eswa.2014.05.002
[11] G. Giallombardo, L. Moccia, M. Salani and I. Vacca, Modeling and solving the Tactical Berth Allocation Problem. Transp. Res. Part B44 (2010) 232-245. · doi:10.1016/j.trb.2009.07.003
[12] M.M. Golias, M. Boile and S. Theofanis, Berth scheduling by customer service differentiation: A multi-objective approach. Transp. Res. Part E45 (2009) 878-892. · doi:10.1016/j.tre.2009.05.006
[13] Q.-M. Hu, Z.-H. Hu and Y. Du, Berth and quay-crane allocation problem considering fuel consumption and emissions from vessels. Comput. Ind. Eng.70 (2014) 1-10. · doi:10.1016/j.cie.2014.01.003
[14] A. Imai, K. Nagaiwa and C.W. Tat, Efficient planning of berth allocation for container terminals in Asia. J. Adv. Transp.31 (1997) 75-94. · doi:10.1002/atr.5670310107
[15] A. Imai, E. Nishimura and S. Papadimitriou, The dynamic berth allocation problem for a container port 35 (2001) 401-417.
[16] A. Imai, E. Nishimura and S. Papadimitriou, Berth allocation with service priority. Transp. Res. Part B37 (2003) 437-457. · doi:10.1016/S0191-2615(02)00023-1
[17] N. Kenan and A. Diabat, A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem. Proc. Comput. Sci.61 (2015) 527-532. · doi:10.1016/j.procs.2015.09.210
[18] M. Krčum, A. Gudelj and S. Vlahinic, Genetic Algorithm for Solving Berth and Quay Cranes Assignment problems, in 2nd International Conference on Ports and Waterways (2007) 165-177.
[19] F. Meisel and C. Bierwirth, Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. Part E45 (2009) 196-209. · doi:10.1016/j.tre.2008.03.001
[20] M.F. Monaco and M. Sammarra, The berth allocation problem: a strong formulation solved by a Lagrangean approach. Transp. Sci.41 (2007) 25-280. · doi:10.1287/trsc.1060.0171
[21] W. Schoonenberg, J. Hols and A. Diabat, A Cost Based Approach for a Crane Assignment and Scheduling Problem, in International Conference on Industrial Engineering and Systems Management (IESM), October 21-23 (2015).
[22] A. Simrin and A. Diabat, The dynamic berth allocation problem: A linearized formulation. RAIRO: RO49 (2015) 473-494. · Zbl 1322.90022 · doi:10.1051/ro/2014039
[23] A.S. Simrin, N.N. Alkawaleet and A.H. Diabat, A Lagrangian Relaxation based Heuristic for the Static Berth Allocation Problem using the Cutting Plane Method, in Proceedings of the 15th International Conference on Enterprise Information Systems (2013) 565-569.
[24] E. Theodorou and A. Diabat, A Joint Quay Crane Assignment and Scheduling Problem: Formulation, Solution Algorithm and Computational Results. Optim. Lett.9 (2015) 799-817. · Zbl 1320.90044 · doi:10.1007/s11590-014-0787-x
[25] D. Xu, C.-L. Li and J.Y.-T. Leung, Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res.216 (2012) 47-56. · Zbl 1237.90136 · doi:10.1016/j.ejor.2011.07.012
[26] Q. Zeng, A. Diabat and Q. Zhang, A simulation optimization approach for solving the dual-cycling problem in container terminals. Marit. Policy Manag.42 (2015) 87-94. · doi:10.1080/03088839.2015.1043362
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.