AN INTEGRATED BERTH ALLOCATION AND YARD ASSIGNMENT PROBLEM FOR BULK PORTS: FORMULATION AND CASE STUDY

被引:18
作者
Al-Hammadi, Jasem [1 ]
Diabat, Ali [1 ]
机构
[1] Masdar Inst Sci & Technol, Dept Engn & Management, Abu Dhabi, U Arab Emirates
关键词
Berth allocation problem; yard assignment; MIP; bulk ports; maritime logistics; QUAY CRANE ASSIGNMENT; SCHEDULING PROBLEM; PRICE ALGORITHM; SOLVE;
D O I
10.1051/ro/2015048
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:267 / 284
页数:18
相关论文
共 31 条
[1]   A Lagrangian relaxation-based heuristic for the multi-ship quay crane scheduling problem with ship stability constraints [J].
Al-Dhaheri, Noura ;
Diabat, Ali .
ANNALS OF OPERATIONS RESEARCH, 2017, 248 (1-2) :1-24
[2]   A simulation-based Genetic Algorithm approach for the quay crane scheduling under uncertainty [J].
Al-Dhaheri, Noura ;
Jebali, Aida ;
Diabat, Ali .
SIMULATION MODELLING PRACTICE AND THEORY, 2016, 66 :122-138
[3]   The quay crane scheduling problem with nonzero crane repositioning time and vessel stability constraints [J].
Al-Dhaheri, Noura ;
Jebali, Aida ;
Diabat, Ali .
COMPUTERS & INDUSTRIAL ENGINEERING, 2016, 94 :230-244
[4]   ON THE BERTH ALLOCATION PROBLEM [J].
Alzaabi, Shaikha Ahmed Jumaa ;
Diabat, Ali .
RAIRO-OPERATIONS RESEARCH, 2016, 50 (03) :491-501
[5]  
[Anonymous], P 2008 WINT SIM C
[6]   Online rules for container stacking [J].
Borgman, Bram ;
van Asperen, Eelco ;
Dekker, Rommert .
OR SPECTRUM, 2010, 32 (03) :687-716
[7]   Developing a dynamic rolling-horizon decision strategy for yard crane scheduling [J].
Chang, Daofang ;
Jiang, Zuhua ;
Yan, Wei ;
He, Junliang .
ADVANCED ENGINEERING INFORMATICS, 2011, 25 (03) :485-494
[8]   An Integrated Quay Crane Assignment and Scheduling Problem [J].
Diabat, Ali ;
Theodorou, Effrosyni .
COMPUTERS & INDUSTRIAL ENGINEERING, 2014, 73 :115-123
[9]   A Lagrangian relaxation approach for solving the integrated quay crane assignment and scheduling problem [J].
Fu, Yi-Min ;
Diabat, Ali .
APPLIED MATHEMATICAL MODELLING, 2015, 39 (3-4) :1194-1201
[10]   A multi-vessel quay crane assignment and scheduling problem: Formulation and heuristic solution approach [J].
Fu, Yi-Min ;
Diabat, Ali ;
Tsai, I-Tsung .
EXPERT SYSTEMS WITH APPLICATIONS, 2014, 41 (15) :6959-6965