The impact of globalization on maritime transportation has led to its enormous growth over the last decade. Due to the rapid increase in sea-borne demand, large emphasis is placed on making ports more efficient, by promoting the effective utilization of available resources. Therefore, the role of optimization becomes crucial, as port operators aim for the cost-effective option of maximizing port efficiency, rather than the costly alternative of expanding existing capacity. One of the most important seaside planning problems that has received a great deal of attention in research streams is the assignment of quay space to incoming vessels; it is known as the Berth Allocation Problem (BAP). Even though it has been studied extensively, there remain certain unaddressed gaps. Relatively little attention has been focused on the operation of bulk ports, in which terminal operators are concerned with integrating and managing the sea-side area (wharf) and the buffer area for storage. The cargo type must be explicitly known to the bulk port operator, who in turn assigns to it the best storage area and the use of appropriate specialized equipment for loading and discharging. It is evident that the integration of the BAP with yard assignment is necessary, in order to maximize efficiency and obtain the optimal berthing plan in bulk ports. Thus, the current paper studies the integrated dynamic hybrid berth allocation and yard assignment problem (BYAP) in the context of bulk ports. Important assumptions are taken into consideration in order to produce a realistic and practical model. Finally, a relevant case study is presented for the case of Mina Zayed Port in Abu Dhabi.
Accepté le :
DOI : 10.1051/ro/2015048
Mots-clés : Berth allocation problem, yard assignment, MIP, bulk ports, maritime logistics
@article{RO_2017__51_1_267_0,
author = {Al-Hammadi, Jasem and Diabat, Ali},
title = {An integrated berth allocation and yard assignment problem for bulk ports: {Formulation} and case study},
journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
pages = {267--284},
publisher = {EDP-Sciences},
volume = {51},
number = {1},
year = {2017},
doi = {10.1051/ro/2015048},
mrnumber = {3605904},
zbl = {1358.90014},
language = {en},
url = {http://archive.numdam.org/articles/10.1051/ro/2015048/}
}
TY - JOUR AU - Al-Hammadi, Jasem AU - Diabat, Ali TI - An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study JO - RAIRO - Operations Research - Recherche Opérationnelle PY - 2017 SP - 267 EP - 284 VL - 51 IS - 1 PB - EDP-Sciences UR - http://archive.numdam.org/articles/10.1051/ro/2015048/ DO - 10.1051/ro/2015048 LA - en ID - RO_2017__51_1_267_0 ER -
%0 Journal Article %A Al-Hammadi, Jasem %A Diabat, Ali %T An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study %J RAIRO - Operations Research - Recherche Opérationnelle %D 2017 %P 267-284 %V 51 %N 1 %I EDP-Sciences %U http://archive.numdam.org/articles/10.1051/ro/2015048/ %R 10.1051/ro/2015048 %G en %F RO_2017__51_1_267_0
Al-Hammadi, Jasem; Diabat, Ali. An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study. RAIRO - Operations Research - Recherche Opérationnelle, Tome 51 (2017) no. 1, pp. 267-284. doi : 10.1051/ro/2015048. http://archive.numdam.org/articles/10.1051/ro/2015048/
and , The Quay Crane Scheduling Problem. J. Manufact. Syst. 36 (2015) 87–94. | DOI
and , A Lagrangian-relaxation-based heuristic for the multiship quay crane scheduling problem with ship stability constraints. Ann. Oper. Res. 248 (2017) 1–24. | DOI | MR | Zbl
, and , A simulation based Genetic Algorithm approach for the Quay Crane Scheduling under uncertainty. Simul. Model. Pr. Theory 66 (2016a) 122–138. | DOI
, and , The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints. Comput. Indus. Eng. 94 (2016b) 230–244. | DOI
and , On the Berth Allocation Problem. RAIRO: OR 50 (2016) 491–501. | DOI | Numdam | MR | Zbl
, and , Online rules for container stacking. OR Spectrum 32 (2010) 687–716. | DOI | Zbl
, , and , Developing a dynamic rolling-horizon decision strategy for yard crane scheduling. Adv. Eng. Inform. 25 (2011) 485–494. | DOI
and , An Integrated Quay Crane Assignment and Scheduling Problem. Comput. Indus. Eng. 73 (2014) 115–123. | DOI
and , A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem. Appl. Math. Model. 39 (2015) 1194–1201. | DOI | MR | Zbl
, and , 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, The Tactical Berth Allocation Problem (TBAP) with quay crane assignment and transshipment-related quadratic yard costs. In European Transport Conference (2008).
, and , A proactive approach for simultaneous berth and quay crane scheduling problem with stochastic arrival and handling time. Eur. J. Oper. Res. 207 (2010) 1327–1340. | DOI | Zbl
M.P.M. Hendriks, M. Laumanns, E. Lefeber and J.T. Udding, Robust periodic berth planning of container vessels. In Proc. of the Third German Korean Workshop on Container Terminal Management: IT-based Planning and Control of Seaport Container Terminals and Transportation Systems (2008) 1–13.
, , and , The simultaneous berth and quay crane allocation problem. Transportation Research Part E: Logistics and Transportation Review 44 (2008) 900–920. | DOI
, and , Berthing ships at a multi-user container terminal with a limited quay capacity. Transportation Research Part E: Logistics and Transportation Review 44 (2008) 136–151. | DOI
, , and , The Berth Allocation Problem with Service Time and Delay Time Objectives. Maritime Econ. Logist. 9 (2007) 269–290. | DOI
and , A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem. Proc. Comput. Sci. 61 (2015) 527–532. | DOI
, and , The continuous berth allocation problem: A greedy randomized adaptive search solution. Transportation Research Part E: Logistics and Transportation Review 46 (2010) 1017–1029. | DOI
P. Legato, R.M. Mazza and R. Trunfio, Simulation-Based Optimization for the Quay Crane Scheduling Problem. In Proc. of the 2008 Winter Simulation Conference (2008).
, and , A quay crane dynamic scheduling problem by hybrid evolutionary algorithm for berth allocation planning. Comput. Indus. Eng. 56 (2009) 1021–1028. | DOI
, and , Quay crane scheduling at container terminals to minimize the maximum relative tardiness of vessel departures. Naval Res. Logist. 53 (2006) 60–74. | DOI | MR | Zbl
F. Meisel, Seaside operations planning in container terminals. Physica-Verlag Heidelberg (2009).
and , A scheduling method for Berth and Quay Cranes. OR Spectrum 25 (2003) 1–23. | DOI | MR | Zbl
Y. Park, B. Lee, K. Kim and K. Ryu, A quay crane scheduling method considering interference of yard cranes in container terminals. In vol. 4293, MICAI 2006: Advances in Artificial Intelligence (2006) 461–471.
, , and , A branch-and-price algorithm to solve the integrated berth allocation and yard assignment problem in bulk ports. Eur. J. Oper. Res. 235 (2014) 399–411. | DOI | MR | Zbl
, and , A GRASP-based metaheuristic for the Berth Allocation Problem and the Quay Crane Assignment Problem by managing vessel cargo holds. Appl. Intell. 40 (2014) 273–290. | 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), Seville, Spain (2015) 21–23.
and , The dynamic berth allocation problem: A linearized formulation. RAIRO: OR 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 Proc. of the 15th International Conference on Enterprise Information Systems (2013) 565–569.
and , A Joint Quay Crane Assignment and Scheduling Problem: Formulation, Solution Algorithm and Computational Results. Optim. Lett. 9 (2015) 799–817. | DOI | MR | Zbl
, and , Exact and heuristic methods to solve the berth allocation problem in bulk ports. Transportation Research Part E: Logistics and Transportation Rev. 54 (2013) 14–31. | DOI
, and , Berth allocation with time-dependent physical limitations on vessels. Eur. J. Oper. Res. 216 (2012) 47–56. | DOI | MR | Zbl
, and , A simulation optimization approach for solving the dual-cycling problem in container terminals. Maritime Policy & Management 42 (2015) 87–94. | DOI
Cité par Sources :
