On the Berth Allocation Problem
RAIRO - Operations Research - Recherche Opérationnelle, Volume 50 (2016) no. 3, pp. 491-501.

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.

DOI: 10.1051/ro/2015029
Classification: 90B06, 90B35
Keywords: Berth allocation problem, MIP formulation, container terminals, maritime logistics
Alzaabi, Shaikha Ahmed Jumaa 1; Diabat, Ali 1

1 Department of Engineering Systems and Management, Masdar Institute of Science and Technology, Abu Dhabi, United Arab Emirates.
     author = {Alzaabi, Shaikha Ahmed Jumaa and Diabat, Ali},
     title = {On the {Berth} {Allocation} {Problem}},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {491--501},
     publisher = {EDP-Sciences},
     volume = {50},
     number = {3},
     year = {2016},
     doi = {10.1051/ro/2015029},
     zbl = {1351.90021},
     mrnumber = {3519329},
     language = {en},
     url = {http://archive.numdam.org/articles/10.1051/ro/2015029/}
AU  - Alzaabi, Shaikha Ahmed Jumaa
AU  - Diabat, Ali
TI  - On the Berth Allocation Problem
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2016
SP  - 491
EP  - 501
VL  - 50
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/articles/10.1051/ro/2015029/
DO  - 10.1051/ro/2015029
LA  - en
ID  - RO_2016__50_3_491_0
ER  - 
%0 Journal Article
%A Alzaabi, Shaikha Ahmed Jumaa
%A Diabat, Ali
%T On the Berth Allocation Problem
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2016
%P 491-501
%V 50
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/articles/10.1051/ro/2015029/
%R 10.1051/ro/2015029
%G en
%F RO_2016__50_3_491_0
Alzaabi, Shaikha Ahmed Jumaa; Diabat, Ali. On the Berth Allocation Problem. RAIRO - Operations Research - Recherche Opérationnelle, Volume 50 (2016) no. 3, pp. 491-501. doi : 10.1051/ro/2015029. http://archive.numdam.org/articles/10.1051/ro/2015029/

N. Al-Dhaheri and A. Diabat, The Quay Crane Scheduling Problem. J. Manuf. Syst. 36 (2015) 87–94. | DOI

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). | MR

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

N. Al-Dhaheri, A. Jebali and A. Diabat, A simulation based Genetic Algorithm approach for the Quay Crane Scheduling under uncertainty. Simul. Model. Pract. Theory 66 (2016) 122–138. | DOI

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). | DOI | Numdam | MR

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. | DOI | MR | Zbl

A. Diabat and E. Theodorou, An Integrated Quay Crane Assignment and Scheduling Problem. Comput. Ind. Eng. 73 (2014) 115–123. | DOI | MR

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

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 | MR | Zbl

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

G. Giallombardo, L. Moccia, M. Salani and I. Vacca, Modeling and solving the Tactical Berth Allocation Problem. Transp. Res. Part B 44 (2010) 232–245. | DOI

M.M. Golias, M. Boile and S. Theofanis, Berth scheduling by customer service differentiation: A multi-objective approach. Transp. Res. Part E 45 (2009) 878–892. | DOI

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

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

A. Imai, E. Nishimura and S. Papadimitriou, The dynamic berth allocation problem for a container port 35 (2001) 401–417.

A. Imai, E. Nishimura and S. Papadimitriou, Berth allocation with service priority. Transp. Res. Part B 37 (2003) 437–457. | DOI

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

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.

F. Meisel and C. Bierwirth, Heuristics for the integration of crane productivity in the berth allocation problem. Transp. Res. Part E 45 (2009) 196–209. | DOI

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

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).

A. Simrin and A. Diabat, The dynamic berth allocation problem: A linearized formulation. RAIRO: RO 49 (2015) 473–494. | DOI | Numdam | MR | Zbl

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.

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. | DOI | MR | Zbl

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. | DOI | MR | Zbl

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

Cited by Sources: