A survey of berth allocation and quay crane scheduling problems in container terminals

Bierwirth, Christian; Meisel, Frank

doi:10.1016/j.ejor.2009.05.031

Cited by 675 publications

(351 citation statements)

References 86 publications

Supporting

Mentioning

349

Contrasting

Unclassified

Order By: Relevance

“…Recent extensions of the BAP are integrated planning of berth allocation and quay cranes [19][20][21]. For a container terminal, effective berth and quay crane schedules have a great influence on the improvement of both operations.…”

Section: Integrated Modelsmentioning

confidence: 99%

A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

Ilati

Sheikholeslami

Hassannayebi

2014

PROMET

View full text Add to dashboard Cite

show abstract

Section: Integrated Modelsmentioning

confidence: 99%

A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

Ilati

Sheikholeslami

Hassannayebi

2014

PROMET

View full text Add to dashboard Cite

show abstract

“…Some of the most active areas within the container industry are the berth allocation problem (see e.g. (Bierwirth and Meisel, 2010)), stowage plans for container vessels (see e.g. (Delgado et al, 2012)) and the container stacking problem (see e.g.…”

Section: Literature Reviewmentioning

confidence: 99%

A new approach to the Container Positioning Problem

et al. 2015

View full text Add to dashboard Cite

In this paper the Container Positioning Problem is revisited. This problem arises at busy container terminals and requires one to minimize the use of block cranes in handling the containers that must wait at the terminal until their next means of transportation. We propose a new Mixed Integer Programming model that not only improves on earlier attempts at this problem, but also better reflects reality. In particular, the proposed model adopts a preference to reshuffle containers in line with a just-in-time concept, as it is assumed that data is more accurate the closer to a container's scheduled departure the time is. Other important improvements include a reduction in the model size, and the ability of the model to consider containers initially at the terminal. In addition, we describe several classes of valid inequalities for this new formulation and present a rolling horizon based heuristic for solving larger instances of the problem. We show that this new formulation drastically outperforms previous attempts at the problem through a direct comparison on instances available in the literature. Furthermore, we also show that the rolling horizon based heuristic can further reduce the solution time on the larger of these instances as well as find acceptable solutions to much bigger, artificially generated, instances.

show abstract

“…To show similarities and differences in the existing models for berth allocation, Bierwirth and Meisel [3] developed a classification scheme according to four attributes (see Figure 3.4). The spatial attribute concerns the berth layout and water depth restrictions.…”

Section: Literature Reviewmentioning

confidence: 99%

A decision support system for managing combinatorial problems in container terminals

Salido

Rodriguez-Molins

Barber

2012

Knowledge-Based Systems

View full text Add to dashboard Cite

A survey of berth allocation and quay crane scheduling problems in container terminals

Cited by 675 publications

References 86 publications

A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

A Simulation-Based Optimization Approach for Integrated Port Resource Allocation Problem

A new approach to the Container Positioning Problem

A decision support system for managing combinatorial problems in container terminals

Contact Info

Product

Resources

About