An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals

Yangcan Wu, Lixin Miao and Ya Jia

Discrete Dynamics in Nature and Society, 2021, vol. 2021, 1-9

Abstract: Uncertainty is an inevitable aspect of seaside operations in container terminals. Operators therefore need to find robust plans that can resist the impact of uncertainties. Instead of solving a stochastic berth allocation problem, this paper proposes an efficient procedure for inserting buffers into baseline berth plans to strengthen the schedule stability. Such a method is highly versatile and compatible with various solutions to berth allocation problem with different objectives. Numerical results obtained by using simulation on a representative set of instances of the problem are reported; these indicate that the proposed procedure not only increases the flexibility of operations with minor loss of resource utilization but also addresses the impact of service priority. Hence, the contribution in this paper will provide a short path that bridges the gap between berth allocation problem in deterministic and stochastic circumstances.

Date: 2021
References: Add references at CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://downloads.hindawi.com/journals/ddns/2021/6619538.pdf (application/pdf)
http://downloads.hindawi.com/journals/ddns/2021/6619538.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:jnddns:6619538

DOI: 10.1155/2021/6619538

Access Statistics for this article

More articles in Discrete Dynamics in Nature and Society from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().