Author
Listed:
- Ran, Lingyu
- Cheng, Yongxi
- Zhang, Guiqing
- Tong, Weitian
Abstract
Berth allocation is a crucial scheduling task for port operations, as it influences all subsequent arrangements. Inefficient berth allocation often results in port congestion, which is a major challenge for many ports nowadays. To alleviate container port congestion and enhance operational efficiency, this study proposes a novel multi-terminal dynamic berth allocation problem considering tidal time windows and channel constraints (MDBAP_TC). An integer programming model is developed to minimize total costs. To solve the MDBAP_TC, a cluster-enhanced hybrid particle swarm optimization (HCPSO) algorithm with an embedded solver is developed. This algorithm incorporates a linearly decreasing inertia weight strategy (to update its inertia weight), and introduces an adaptive adjustment mechanism that guides the population toward improved solutions with a specified probability. For comparative analysis, three additional algorithms are also developed: a hybrid particle swarm optimization algorithm with solver (HPSO), a hybrid genetic algorithm (HGA) with solver, and a Lagrange relaxation with sub-gradient (LS) optimization. Numerical experiments, conducted on 100 small- and 30 medium-scale instances, validate the effectiveness of the proposed model. The results show that HCPSO achieves solution quality comparable to that of the Gurobi solver in 93 instances and outperforms HGA, HPSO, and LS. Furthermore, the robustness of the model is demonstrated through tests on 20 sets of instances, highlighting its ability to handle variations in the number of vessels. A simulation study with 100 vessels validates that more effective berth allocation can be obtained by taking into account tidal time windows. Sensitivity analysis results indicate that key parameters of the proposed model should be adjusted by potential users based on specific real-world scenarios. Overall, this study offers a valuable decision-making tool for port schedulers seeking to optimize berth resource allocation, alleviate port congestion, and improve terminal operational efficiency.
Suggested Citation
Ran, Lingyu & Cheng, Yongxi & Zhang, Guiqing & Tong, Weitian, 2025.
"Multi-terminal continuous and dynamic berth allocation problem considering tidal time windows and channel constraints,"
Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 203(C).
Handle:
RePEc:eee:transe:v:203:y:2025:i:c:s1366554525004065
DOI: 10.1016/j.tre.2025.104365
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:transe:v:203:y:2025:i:c:s1366554525004065. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/600244/description#description .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.