MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Agra, Agostinho; Oliveira, Maryse

doi:10.1016/j.ejor.2017.05.040

Cited by 118 publications

(47 citation statements)

References 46 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Correcher et al [24] focused on the berth allocation problem and the quay crane assignment problem in an integrated way, and proposed a new mixed integer linear model to solve. Agra et al [25] investigated an integrated berth allocation, quay crane assignment, and scheduling problem in which a heterogeneous set of cranes was considered, and a rolling horizon metaheuristic was introduced to solve hard instances. Moreover, the uncertainty in vessel arrival times and quay crane handling rates was considered, and the recoverable robustness was introduced for the weekly berth and quay crane planning problem by Iris et al [26].…”

Section: Literature Reviewmentioning

confidence: 99%

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Song

2019

Information

View full text Add to dashboard Cite

Container terminals are the typical representatives of complex supply chain logistics hubs with multiple compound attributes and multiple coupling constraints, and their operations are provided with the strong characteristics of dynamicity, nonlinearity, coupling, and complexity (DNCC). From the perspective of computational logistics, we propose the container terminal logistics generalized computing architecture (CTL-GCA) by the migration, integration, and fusion of the abstract hierarchy, design philosophy, execution mechanism, and automatic principles of computer organization, computing architecture, and operating system. The CTL-GCA is supposed to provide the problem-oriented exploration and exploitation elementary frameworks for the abstraction, automation, and analysis of green production at container terminals. The CTL-GCA is intended to construct, evaluate, and improve the solution to planning, scheduling, and decision at container terminals, which all are nondeterministic polynomial hard problems. Subsequently, the logistics generalized computational pattern recognition and performance evaluation of a practical container terminal service case study is launched by the qualitative and quantitative approach from the sustainable perspective of green production. The case study demonstrates the application, utilization, exploitation, and exploration of CTL-GCA preliminarily, and finds the unsustainable patterns of production at the container terminal. From the above, we can draw the following conclusions. For one thing, the CTL-GCA makes a definition of the abstract and automatic running architecture of logistics generalized computation for container terminals (LGC-CT), which provides an original framework for the design and implementation of control and decision mechanism and algorithm. For another, the CTL-GCA can help us to investigate the roots of DNCC thoroughly, and then the CTL-GCA makes for conducting the efficient and sustainable running pattern recognition of LGC-CT. It is supposed to provide a favorable guidance and supplement to define, design, and implement the agile, efficient, sustainable, and robust task scheduling and resource allocation for container terminals by computational logistics whether in the strategy level or the tactical one.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Song

2019

Information

View full text Add to dashboard Cite

show abstract

“…The results showed that the integration approach might be efficient in different cases. Recently, Agra and Oliveira (2018) studied the integrated berth allocation, quay crane assignment and scheduling problem motivated by a real case where a heterogeneous set of cranes was considered. They proposed a MIP model based on the relative position formulation.…”

Section: Literature Reviewmentioning

confidence: 99%

“…Indeed, a significant focus has been given to the integrated berth allocation and crane assignment problem for container terminals (e.g. Agra & Oliveira, 2018;Vacca et al, 2013). However, few works exist dealing with the case of bulk ports.…”

Section: Introductionmentioning

confidence: 99%

A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports

Krimi¹,

Benmansour²,

Cadi³

et al. 2019

10.5267/j.ijiec

View full text Add to dashboard Cite

In this paper, an efficient rolling horizon-based heuristic is presented to solve the integrated berth allocation and crane assignment problem in bulk ports. We were guided by a real case study of a multi-terminal port, owned by our Moroccan industrial partner, under several restrictions as high tides and installation's availability. First, we proposed a mixed integer programming model for the problem. Then, we investigated a strategy to dissipate the congestion within the presented rolling horizon. A variety of experiments were conducted, and the obtained results show that the proposed methods were efficient from a practical point of view.

show abstract

“…Based on the recent advances in this research area, in 2017, Wu and Ma [10] focused on the problem of scheduling quay cranes, by considering the draft and trim constraints, with the goal of minimizing loading time. In 2018, Agra and Oliveira [11] presented an integrated model of berth allocation, quay crane assignment and scheduling problem, considering a set of heterogeneous cranes with discretion for time and space variables. The efficient operation of the terminal depends on the proper planning of the container movement, called "stowage planning".…”

Section: Introduction and Literature Reviewmentioning

confidence: 99%

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Fazli

Fathollahi-Fard

Tian

2019

IJE

View full text Add to dashboard Cite

A B S T R A C TNowadays, there is much attention for planning of container terminals in the global trade centers. The high cost of quay cranes motivates both scholars and industrial practitioners especially in the last decade to develop novel optimization models to address this dilemma. This study proposes a coordinated optimization model to cover both Quay Crane Scheduling Problem (QCSP) and Quay Crane Assignment Problem (QCAP) as among the first attempts in this area. Another main contribution of this paper is to apply a recent nature-inspired algorithm called Red Deer Algorithm (RDA). The RDA revealed its performance for a variety of combinatorial optimization problems in different real-world applications. This is the first attempt in the literature to employ this recent metaheuristic to solve the proposed Coordinated Quay Crane Scheduling and Assignment Problem (CQCSAP). Finally, an extensive comparison discussion is considered to reveal the main benefits of the proposed optimization model and solution algorithm.

show abstract

MIP approaches for the integrated berth allocation and quay crane assignment and scheduling problem

Cited by 118 publications

References 46 publications

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

Container Terminal Logistics Generalized Computing Architecture and Green Initiative Computational Pattern Performance Evaluation

A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports

Addressing a Coordinated Quay Crane Scheduling and Assignment Problem by Red Deer Algorithm

Contact Info

Product

Resources

About