An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals
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...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Discrete Dynamics in Nature and Society |
| Online Access: | http://dx.doi.org/10.1155/2021/6619538 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1849691015862026240 |
|---|---|
| author | Yangcan Wu Lixin Miao |
| author_facet | Yangcan Wu Lixin Miao |
| author_sort | Yangcan Wu |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-e90e6e2fde69491397803d63892f97b2 |
| institution | DOAJ |
| issn | 1026-0226 1607-887X |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Discrete Dynamics in Nature and Society |
| spelling | doaj-art-e90e6e2fde69491397803d63892f97b22025-08-20T03:21:09ZengWileyDiscrete Dynamics in Nature and Society1026-02261607-887X2021-01-01202110.1155/2021/66195386619538An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container TerminalsYangcan Wu0Lixin Miao1Department of Industrial Engineering, Tsinghua University, Beijing 10084, ChinaResearch Center for Modern Logistics, Tsinghua Shenzhen International Graduate School, Shenzhen 518055, ChinaUncertainty 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.http://dx.doi.org/10.1155/2021/6619538 |
| spellingShingle | Yangcan Wu Lixin Miao An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals Discrete Dynamics in Nature and Society |
| title | An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals |
| title_full | An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals |
| title_fullStr | An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals |
| title_full_unstemmed | An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals |
| title_short | An Efficient Procedure for Inserting Buffers to Generate Robust Berth Plans in Container Terminals |
| title_sort | efficient procedure for inserting buffers to generate robust berth plans in container terminals |
| url | http://dx.doi.org/10.1155/2021/6619538 |
| work_keys_str_mv | AT yangcanwu anefficientprocedureforinsertingbufferstogeneraterobustberthplansincontainerterminals AT lixinmiao anefficientprocedureforinsertingbufferstogeneraterobustberthplansincontainerterminals AT yangcanwu efficientprocedureforinsertingbufferstogeneraterobustberthplansincontainerterminals AT lixinmiao efficientprocedureforinsertingbufferstogeneraterobustberthplansincontainerterminals |