Collaborative Scheduling for Yangtze Riverport Channels and Berths Using Multi-Objective Optimization
Source abstract
Abstract
Efficient coordinated scheduling has long been a focal point in port research, complicated by the diverse optimization goals dictated by different port characteristics. This study focuses on Yangtze River ports, exploring coordinated scheduling amidst river–sea intermodal transportation. Our research aims to reduce berth deviation costs and shorten the total scheduling time for ships, while maximizing berth utilization rates for ports. Initially, we analyzed the operational realities of Yangtze River ports and waterways. Subsequently, we innovatively introduced three key factors influencing scheduling: berth preferences, seagoing ship inspections, and planning cycles. Finally we proposed the optimized Non-dominated Sorting Genetic Algorithm III (NSGA-III). Evaluating the model using a seven-day dataset of vessel activities at Yangtze River ports revealed significant improvements: the optimized NSGA-III enhanced objective values by 30.81%, 13.73%, and 12.11% compared to the original scheduling approach, surpassing both conventional NSGA-III and NSGA-II algorithms. This study underscores the model’s efficacy in not only reducing operational costs through optimized ship and berth sequencing but also in enhancing clearance efficiency for relevant authorities.
Source: crossref · Quality: baseline
Research context
OpenAlex topics: Maritime Ports and Logistics · Maritime Transport Emissions and Efficiency · Vehicle Routing Optimization Methods
SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.
Affiliations
Navigation College, Dalian Maritime University, Dalian 116026, China
Zhuhai Port Information Technology Co., Ltd., 4th Floor, Haizhu Bldg., Jiuzhou Avenue, Zhuhai 519000, China
Zhilong (Dalian) Marine Technology Co., Ltd., 11th Floor, No. 523 Huangpu Road, Dalian 116020, China
Funding
Dalian Bureau of Science and Technology · Liaoning Provincial Department of Science and Technology
References (26)
Show source-provided references
1. Tengecha, N.A., and Zhang, X. (2022). An efficient algorithm for the berth and quay crane assignments considering operator performance in container terminal using particle swarm model. J. Mar. Sci. Eng., 10.10.3390/jmse10091232 ↗
2. Tavakkoli-Moghaddam, R., Fatemi-Anaraki, S., Abdolhamidi, D., and Vahedi-Nouri, B. (2019, January 25–27). Integrated waterway scheduling, berth allocation and quay crane assignment problem by using a hybrid flow shop concept. Proceedings of the 2019 International Conference on Industrial Engineering and Systems Management (IESM), Shanghai, China.10.1109/IESM45758.2019.8948202 ↗
3. Jiang, X., Zhong, M., Shi, J., Li, W., Sui, Y., and Dou, Y. (2022). Overall scheduling model for vessels scheduling and berth allocation for ports with restricted channels that considers carbon emissions. J. Mar. Sci. Eng., 10.10.3390/jmse10111757 ↗
4. Evaluating the solution performance of IP and CP for berth allocation with time-varying water depth10.1016/j.tre.2016.01.007 ↗
5. Y-shaped bifurcated channel ship traffic dispatch optimization modeling
6. Baoli, L. (2022). Seaport Berth and Channel Scheduling Model and Algorithm under Complex Navigation Environment. [Ph.D. Thesis, Huazhong University of Science and Technology].
7. Dai, Y., Li, Z., and Wang, B. (2023). Optimizing berth allocation in maritime transportation with quay crane setup times using reinforcement learning. J. Mar. Sci. Eng., 11.10.3390/jmse11051025 ↗
8. Integrated optimization of berth allocation and ship dispatch considering the influence of tide
9. An expanded robust optimisation approach for the berth allocation problem considering uncertain operation time10.1016/j.omega.2021.102444 ↗
10. Zheng, Z., Yang, B., and Hu, Z. (2013). Container port discrete berth allocation problem under preference berth constraints. Water Transp. Eng., 64–68+79.
11. The three-year action plan for the development of multimodal transport in the Yangtze River Economic Belt was launched
12. Medium and long term ship arrival and departure scheduling optimization based on greedy-genetic optimization algorithm
13. An interval-stochastic programming based approach for a fully uncertain multi-objective and multi-mode resource investment project scheduling problem with an application to ERP project implementation10.1016/j.eswa.2020.113189 ↗
14. Particle swarm optimization algorithm for the berth allocation problem10.1016/j.eswa.2013.08.051 ↗
15. Zhang, Y. (2019). Research on Optimization of Berth-Quay Crane Allocation under Uncertain Ship Arrival Time. [Master’s Thesis, Dalian University of Technology].
16. A metaheuristic technique for energy-efficiency in job-shop scheduling10.1017/S026988891600031X ↗
17. Muiltiobjective optimization using nondominated sorting in genetic algorithms10.1162/evco.1994.2.3.221 ↗
18. A fast and elitist multiobjective genetic algorithm: NSGA-II10.1109/4235.996017 ↗
19. An evolutionary many-objective optimization algorithm using reference-point-based nondominated sorting approach, part I: Solving problems with box constraintss10.1109/TEVC.2013.2281535 ↗
20. Ma, X. (2023). Research on Capacity Optimization Configuration of Independent Biomass Gasification Cold Heating and Power Microgrid System. [Ph.D. Thesis, Shandong University].
21. Improving NSGA-III algorithms with information feedback models for large-scale many-objective optimization10.1016/j.future.2020.01.048 ↗
22. Improvement of niche genetic algorithm
23. Wang, S., Shen, Q., Sun, M., Tang, S., and Zhen, Z. (2024). Multi-UAV collaborative target allocation based on improved NSGA-III algorithm. Aviation Weapons, 1–13.
24. Xu, Y., Chen, Y., Wang, C., and Peng, Y. (2023). Improved NSGA-III to solve the high-dimensional multi-objective green flexible job shop scheduling problem. J. Syst. Simul., 1–14.
25. Improvement of niche genetic algorithm and its application in rubber material parameter inversion
26. Multi vehicle dynamic vehicle path optimization under green logistics delivery