考虑潮汐和船舶到港时间不确定性的泊位岸桥联合调度

doi:10.3778/j.issn.1002-8331.2407-0076

摘要/Abstract

摘要： 泊位和岸桥是港口重要资源，其调度直接港口运营效率。聚焦港口的泊位岸桥联合调度所面临的受潮汐影响大及调度资源有限等问题，考虑船舶到达时间不确定性、船舶靠泊偏好、岸桥数量时变、岸桥之间不能相互跨越等现实因素，以船舶等待时间成本、延迟离港成本、船舶在港期间油耗、岸桥装卸成本之和最小为目标构建混合整数规划模型。考虑到问题的复杂性采用自适应大邻域搜索算法对模型进行求解，并针对问题特征设计多种毁灭和修复算子来提高算法的求解精度与效率。通过与CPLEX的对比验证了算法有效性与准确性，与多类算法对比验证了算法的高效性，并通过重要参数的灵敏度分析给出泊位岸桥联合调度相关的建议，可以为港口运营实践提供参考。

关键词: 水路运输, 泊位岸桥联合调度, 自适应大邻域搜索算法, 潮汐因素, 船舶到达时间不确定性, 靠泊偏好

Abstract: Berths and quay cranes are critical resources for ports, and their scheduling directly impacts port operational efficiency. This paper focuses on the joint scheduling of berths and quay cranes in ports, addressing issues such as the significant impact of tides and limited scheduling resources. Considering uncertainties in ship arrival times, ship berthing preferences, time-varying numbers of quay cranes, and the constraint that quay cranes cannot cross each other, the paper aims to minimize the sum of ship waiting time costs, delayed departure costs, fuel consumption during the port stay, and quay crane handling costs. This paper constructs a mixed-integer programming model. Given the complexity of the problem, it employs an adaptive large neighborhood search algorithm to solve the model, and designs various destruction and repair operators tailored to the problem characteristics to improve the solution accuracy and efficiency of the algorithm. Finally, the effectiveness and accuracy of the algorithm are validated through comparison with CPLEX. Its efficiency is confirmed through comparison with various other algorithms. Sensitivity analysis of key parameters provides recommendations for joint scheduling of berths and quay cranes, offering practical references for port operations.

Key words: waterway transportation, joint scheduling of berths and quay cranes, adaptive large neighborhood search algorithm, tidal factors, uncertainty in ship arrival times, berthing preferences

章嘉文, 初良勇. 考虑潮汐和船舶到港时间不确定性的泊位岸桥联合调度[J]. 计算机工程与应用, 2025, 61(20): 379-390.

ZHANG Jiawen, CHU Liangyong. Joint Scheduling of Berths and Quay Cranes Considering Tides and Uncertainty in Ship Arrival Times[J]. Computer Engineering and Applications, 2025, 61(20): 379-390.

参考文献

[1] XIANG X, LIU C C. An almost robust optimization model for integrated berth allocation and quay crane assignment problem[J]. Omega, 2021, 104: 102455.
[2] 梅益群, 韩晓龙. 考虑泊位偏好和岸桥移动的泊位岸桥联合调度[J]. 计算机工程与应用, 2022, 58(6): 241-249.
MEI Y Q, HAN X L. Joint scheduling of berths and quay cranes considering berth preference and quay crane movement[J]. Computer Engineering and Applications, 2022, 58(6): 241-249.
[3] 苟悦, 梁承姬, 张悦. 分时电价下泊位岸桥联合调度研究[J]. 计算机工程与应用, 2024, 60(9): 338-345.
GOU Y, LIANG C J, ZHANG Y. Research on joint scheduling of berths and quay cranes under time-of-use price[J]. Computer Engineering and Applications, 2024, 60(9): 338-345.
[4] 赵姣, 胡卉, 袁华智. 不规则型泊位与岸桥集成分配问题的优化建模和算法研究[J]. 四川大学学报(自然科学版), 2022, 59(4): 42-50.
ZHAO J, HU H, YUAN H Z. Research on optimized modelling and algorithm of integrated allocation of irregular berth and quay crane[J]. Journal of Sichuan University (Natural Science Edition), 2022, 59(4): 42-50.
[5] JI B, HUANG H, YU S S. An enhanced NSGA-II for solving berth allocation and quay crane assignment problem with stochastic arrival times[J]. IEEE Transactions on Intelligent Transportation Systems, 2023, 24(1): 459-473.
[6] LIU C C. Iterative heuristic for simultaneous allocations of berths, quay cranes, and yards under practical situations[J]. Trans-portation Research Part E: Logistics and Transportation Review, 2020, 133: 101814.
[7] CHARGUI K, ZOUADI T, SREEDHARAN V R, et al. A novel robust exact decomposition algorithm for berth and quay crane allocation and scheduling problem considering uncertainty and energy efficiency[J]. Omega, 2023, 118: 102868.
[8] YU J J, TANG G L, VO? S, et al. Berth allocation and quay crane assignment considering the adoption of different green technologies[J]. Transportation Research Part E: Logistics and Transportation Review, 2023, 176: 103185.
[9] LI Y, CHU F, ZHENG F F, et al. A bi-objective optimization for integrated berth allocation and quay crane assignment with preventive maintenance activities[J]. IEEE Transactions on Intelligent Transportation Systems, 2022, 23(4): 2938-2955.
[10] 吴暖, 吴迪, 王诺. 岸桥故障下考虑邻近岸桥共享作业的集装箱码头调度多目标优化[J]. 计算机集成制造系统, 2023, 29(1): 331-339.
WU N, WU D, WANG N. Multi-objective optimization of container terminal scheduling considering shared operation of adjacent quay cranes under quay crane failure[J]. Computer Integrated Manufacturing Systems, 2023, 29(1): 331-339.
[11] MALEKAHMADI A, ALINAGHIAN M, HEJAZI S R, et al. Integrated continuous berth allocation and quay crane assignment and scheduling problem with time-dependent physical constraints in container terminals[J]. Computers & Industrial Engineering, 2020, 147: 106672.
[12] 郑红星, 张敬涛, 刘保利. 考虑潮汐影响的连续泊位和岸桥集成调度[J]. 计算机集成制造统, 2018, 24(10): 2599-2611.
ZHENG H X, ZHANG J T, LIU B L. Integrated continuous berth allocation and quay crane scheduling under tidal influence at container terminal[J]. Computer Integrated Manufacturing Systems, 2018, 24(10): 2599-2611.
[13] KRIMI I, BENMANSOUR R, EL CADI A A, et al. A rolling horizon approach for the integrated multi-quays berth allocation and crane assignment problem for bulk ports[J]. International Journal of Industrial Engineering Computations, 2019,10(4): 577-591.
[14] IRIS ?, LAM J S L. Recoverable robustness in weekly berth and quay crane planning[J]. Transportation Research Part B: Methodological, 2019, 122: 365-389.
[15] SHANG X T, CAO J X, REN J. A robust optimization app-roach to the integrated berth allocation and quay crane assignment problem[J]. Transportation Research Part E: Logistics and Transportation Review, 2016, 94: 44-65.
[16] HE J L, WANG Y, TAN C M, et al. Modeling berth allocation and quay crane assignment considering QC driver cost and operating efficiency[J]. Advanced Engineering Informatics, 2021, 47: 101252.
[17] WANG T S, WANG X C, MENG Q. Joint berth allocation and quay crane assignment under different carbon taxation policies[J]. Transportation Research Part B: Methodological, 2018, 117: 18-36.
[18] CHEIMANOFF N, FONTANE F, KITRI M N, et al. Exact and heuristic methods for the integrated berth allocation and specific time-invariant quay crane assignment problems[J]. Computers & Operations Research, 2022, 141: 105695.
[19] MAURI G R, RIBEIRO G M, LORENA L A N, et al. An adaptive large neighborhood search for the discrete and continuous Berth allocation problem[J]. Computers & Operations Research, 2016, 70: 140-154.
[20] MARTIN-IRADI B, PACINO D, ROPKE S. An adaptive large neighborhood search heuristic for the multi-port continuous berth allocation problem[J]. European Journal of Operational Research, 2024, 316(1): 152-167.
[21] ZHANG C R, ZHENG L, ZHANG Z H, et al. The allocation of berths and quay cranes by using a sub-gradient optimization technique[J]. Computers & Industrial Engineering, 2010, 58(1): 40-50.