A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem

Kenan, Nabil; Diabat, Ali

doi:10.1016/j.procs.2015.09.210

Cited by 18 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…As far as seaside operations are concerned, the three major problems pertaining to this area are the Berth Allocation Problem (BAP), the Quay Crane Assignment Problem (QCAP) and the Quay Crane Scheduling Problem (QCSP) [8,33]. The BAP aims to assign available berthing spaces to incoming vessels, while the QCAP and the QCSP focus on allocating cranes to vessels, and scheduling the operation of these cranes for the unloading and loading of containers, respectively [17,30]. The QCSP is inherently complex and as such has received considerable attention from researchers, with recent work incorporating more realistic considerations, such as vessel stability [1,2,4] and stochasticity [3,12].…”

Section: Introductionmentioning

confidence: 99%

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

Al-Hammadi¹,

Diabat²

2017

RAIRO-Oper. Res.

View full text Add to dashboard Cite

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.

show abstract

Section: Introductionmentioning

confidence: 99%

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

Al-Hammadi¹,

Diabat²

2017

RAIRO-Oper. Res.

View full text Add to dashboard Cite

show abstract

“…Container terminal operations can be distinguished into quayside and landside operations; quayside operations involve receiving the vessel and handling its containers, while the landside operations focus on storing and transporting the containers [17]. The three major problems pertaining to quayside operations are the Berth Allocation Problem (BAP) [8,13,25], the Quay Crane Assignment Problem (QCAP) and the Quay Crane Scheduling Problem (QCSP) [2].…”

Section: Introductionmentioning

confidence: 99%

On the Berth Allocation Problem

Alzaabi¹,

Diabat²

2016

RAIRO-Oper. Res.

View full text Add to dashboard Cite

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.

show abstract

“…The assignment of these cranes is done according to a specific work schedule. Seeing as there are exceptionally high costs involved in the operation of such QCs, it is important to allocate this unloading capacity as efficiently as possible [6]. The allocation issue of the QC capacity has been the focus of much study [2], [7]- [12].…”

Section: Introductionmentioning

confidence: 99%

A cost based approach for a Crane Assignment and Scheduling Problem

Schoonenberg

Hols

Diabat

2015

2015 International Conference on Industrial Engineering and Systems Management (IESM)

Self Cite

View full text Add to dashboard Cite

Different methods are used to address Quay Crane Assignment and Scheduling Problems (QCASP). In current literature often the unloading time is used to optimize QCASPs. However, this approach neglects the value of the vessel's freight. This paper therefore uses a cost based approach to optimize container terminal operations, which allows the model to focus on two objectives. The first objective is to show the impact of varying freight lead time costs on the priority of vessels and consequently the Quay Crane (QC) assignment and scheduling. The second objective is to implement adjustable QC operation costs and working rate and show the impact of particular adjustments. The model results show vessel prioritization based on the value of the vessel's freight. The variation in crane operation cost only impacts the assignment and scheduling in the occurrence of high crane operating costs relative to the value of the vessel's freight.

show abstract

A Branch-and-Price Algorithm to Solve a Quay Crane Scheduling Problem

Cited by 18 publications

References 9 publications

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

An integrated berth allocation and yard assignment problem for bulk ports: Formulation and case study

On the Berth Allocation Problem

A cost based approach for a Crane Assignment and Scheduling Problem

Contact Info

Product

Resources

About