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: | Yangcan Wu, Lixin Miao |
|---|---|
| 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!
|
Similar Items
-
Mathematical Programming Formulations for the Berth Allocation Problems in Container Seaport Terminals
by: Awad M. Aljuaid, et al.
Published: (2024-05-01) -
Discrete Dynamic Berth Allocation Optimization in Container Terminal Based on Deep Q-Network
by: Peng Wang, et al.
Published: (2024-11-01) -
Container Terminal Berth and Yard Collaborative Allocation for Import and Export Synchronous Operations by Computational Logistics
by: Bin Li, et al.
Published: (2022-01-01) -
The berth allocation problem in bulk terminals under uncertainty
by: Filipe Rodrigues
Published: (2025-06-01) -
Disruption Management Approaches for Berth Scheduling in Bulk Terminals
by: Alan Dávila de León, et al.
Published: (2022-01-01)