A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature

Guldogan, Evrim Ursavas; Bulut, Önder; Taşgetiren, M. Fatih

doi:10.1007/978-3-642-25944-9_10

Cited by 6 publications

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Although some of the above considerations regarding physical factors consider water depth (Cheong & Tan, 2008;Cheong et al, 2010;Guldogan, Bulut, & Tasgetiren, 2012;Nishimura et al, 2001), only a few works in the literature take into account tidal constraints. This is the case of the works by Barros, Costa, Oliveira, and Lorena (2011) and Xu et al (2012).…”

Section: Literature Reviewmentioning

confidence: 99%

A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations

Lalla-Ruiz

Expósito‐Izquierdo

Melián-Batista

et al. 2016

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations

Lalla-Ruiz

Expósito‐Izquierdo

Melián-Batista

et al. 2016

European Journal of Operational Research

View full text Add to dashboard Cite

“…Computational experiments were performed using the operational data, collected from Brazilian bulk ports and demonstrated efficiency of the suggested methodology. Guldogan et al (2012) studied the BSP with stochastic arrival and handling times, considering water depth at each berth and vessel drafts. The objective aimed to minimize the total weighted vessel waiting time.…”

Section: Introductionmentioning

confidence: 99%

A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations

Dadashi

Dulebenets

Golias

et al. 2017

MABR

View full text Add to dashboard Cite

Purpose The paper aims to propose a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. Design/methodology/approach This paper proposes a new mathematical model for allocation and scheduling of vessels at multiple marine container terminals of the same port, considering the access channel depth variations by time of day. The access channel serves as a gate for vessels entering or leaving the port. During low-depth tidal periods the vessels with deep drafts have to wait until the depth of the access channel reaches the required depth. Findings A number of numerical experiments are performed using the operational data collected from Port of Bandar Abbas (Iran). Results demonstrate that the suggested methodology is able to improve the existing port operations and significantly decrease delayed vessel departures. Originality/value The contribution of this study to the state of the art is a novel mathematical model for allocation and scheduling of vessels at multiple terminals of the same port, taking into consideration channel depth variations by time of day. To the best of the authors’ knowledge, this is the first continuous berth scheduling linear model that addresses the tidal effects on berth scheduling (both in terms of vessel arrival and departure at/from the berth) at multiple marine container terminals.

show abstract

Berth Allocation and Quay Crane Assignment and Scheduling Problem Under Energy Constraints: Literature Review

Ech-Charrat¹,

El‐Amrani²,

Ezziyyani³

2023

Lecture Notes in Networks and Systems

View full text Add to dashboard Cite

A Dynamic Berth Allocation Problem with Priority Considerations under Stochastic Nature

Cited by 6 publications

References 4 publications

A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations

A Set-Partitioning-based model for the Berth Allocation Problem under Time-Dependent Limitations

A novel continuous berth scheduling model at multiple marine container terminals with tidal considerations

Berth Allocation and Quay Crane Assignment and Scheduling Problem Under Energy Constraints: Literature Review

Contact Info

Product

Resources

About