Collaborative emergency berth scheduling based on decentralized decision and price mechanism

Xu, Youpeng; Du, Yanliang; Li, Yongjian; Zhang, Heng

doi:10.1007/s10479-018-2859-2

Cited by 7 publications

(4 citation statements)

References 24 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…To overcome this, some models of collaborative planning by increasing the collaboration among multi-user terminals have been proposed. In [7], the authors develop a joint berth scheduling through cooperation between adjacent terminals when an unexpected shutdown happened in a terminal. A decentralized mechanism is proposed based on the flexible scheme of transfer payment adjustment.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

A Collaborative Berth Planning Approach for Disruption Recovery

Lyu

Negenborn

Shi

et al. 2022

IEEE Open J. Intell. Transp. Syst.

View full text Add to dashboard Cite

Traditionally, terminal operators create an initial berthing plan before the arrival of incoming vessels. This plan involves decisions on when and where to load or discharge containers for the calling vessels. However, disruptive unforeseen events (i.e., arrival delays, equipment breakdowns, tides, or extreme weather) interfere with the implementation of this initial plan. For terminals, berths and quay cranes are both crucial resources, and their capacity limits the efficiency of port operations. Thus, one way to minimize the adverse effects caused by disruption is to ally different terminals to share berthing resources. In some challenging situations, terminal operators also need to consider the extensive transshipment connections between feeder and mother vessels. Therefore, in this work, we investigate a collaborative variant of the berth allocation recovery problem which focuses on the collaboration among terminals and transshipment connections between vessels. We propose a mixed-integer programming model to (re)-optimize the initial berth and quay crane allocation plan and develop a Squeaky Wheel Optimization metaheuristic to find near-optimal solutions for large-scale instances. The results from the performed computational experiments, considering multiple scenarios with disruptive events, show consistent improvements of up to 40% for the suggested collaborative strategy (in costs for the terminal operators).

show abstract

Section: Related Workmentioning

confidence: 99%

“…Cooperative decisions and collaboration among terminals have been considered in the berth planning problem in [7], [8]. To the best of our knowledge, studies on collaborative berth planning among terminals are limited, not to mention the disruption management model.…”

Section: Introductionmentioning

confidence: 99%

A Collaborative Berth Planning Approach for Disruption Recovery

Lyu

Negenborn

Shi

et al. 2022

IEEE Open J. Intell. Transp. Syst.

View full text Add to dashboard Cite

show abstract

“…Hendriks et al [28], Xu et al [29], Golias et al [30], Zhen [31], and Shang et al [32] focus on robust berth scheduling methods to mitigate the impact of uncertain delay of vessel arrivals and fluctuation of handling time. Xu et al [33] investigate the collaborative emergency berth scheduling in the situation of unexpected shutdown of a terminal. Another strong research trend on BSP looks at collaboration between terminals [34][35][36] and between terminals and liner shipping companies [37][38][39][40][41].…”

Section: Literature Reviewmentioning

confidence: 99%

“…For each p j (j = 1, 2, • • • , m), add rectangle i into p j and set initial x i and y i according to p j . Recalculate y i using expression (32) and then calculate d i using expression (33). Record the new position and height of rectangle i in p j .…”

Section: Encoding and Decoding Of Solutionsmentioning

confidence: 99%

Berth Scheduling Problem Considering Traffic Limitations in the Navigation Channel

Xue

2018

Sustainability

Self Cite

View full text Add to dashboard Cite

In view of the trend of upsizing ships, the physical limitations of natural waterways, huge expenses, and unsustainable environmental impact of channel widening, this paper aims to provide a cost-efficient but applicable solution to improve the operational performance of container terminals that are enduring inefficiency caused by channel traffic limitations. We propose a novel berth scheduling problem considering the traffic limitations in the navigation channel, which appears in many cases including insufficient channel width, bad weather, poor visibility, channel accidents, maintenance dredging of the navigation channel, large vessels passing through the channel, and so on. To optimally utilize the berth and improve the service quality for customers, we propose a mixed-integer linear programming model to formulate the berth scheduling problem under the one-way ship traffic rule in the navigation channel. Furthermore, we develop a more generalized model which can cope with hybrid traffic in the navigation channel including one-way traffic, two-way traffic, and temporary closure of the navigation channel. For large-scale problems, a hybrid simulated annealing algorithm, which employs a problem-specific heuristic, is presented to reduce the computational time. Computational experiments are performed to evaluate the effectiveness and practicability of the proposed method.

show abstract