基于贪心-遗传优化算法的中长期船舶进出港调度优化  

Medium-and Long-term Ship Entry and Exit Scheduling Optimization Based on Greedy-genetic Optimization Algorithm

作　　者：丁可 徐言民[1,2] 关宏旭 李诗杰[1,2] 李柏苇 DING Ke;XU Yanmin;GUAN Hongxu;LI Shijie;LI Bowei(School of Navigation,Wuhan University of Technology,Wuhan 430063,China;Hubei Inland Shipping Technology Key Laboratory,Wuhan 430063,China)

机构地区：[1]武汉理工大学航运学院,武汉430063 [2]内河航运技术湖北省重点实验室,武汉430063

出　　处：《武汉理工大学学报（交通科学与工程版）》2023年第4期770-774,共5页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：国家自然科学基金(62003250)。

摘　　要：文中提出一个目标周期内港口总卸货量最大的目标函数,结合航海实际,建立以靠泊条件、通航模式、船舶窗口期、船舶安全距离等通航限制条件为约束条件的船舶进出港调度优化模型,并选用贪心-遗传组合优化算法(GGA)进行实现.通过假设港口数据的方式来进行模拟试验验证模型及算法的合理性和有效性,并对港口短期调度模式和中长期调度模式进行对比论证.Taking the total discharge capacity of the largest port in a target period as the objective function,combined with the navigation practice,an optimization model of ship’s inbound and outbound scheduling was established with navigation constraints such as berthing conditions,navigation mode,ship window period and ship’s safe distance as constraints,and the greedy-genetic combination optimization algorithm(G-GA)was selected to realize it.The rationality and effectiveness of the model and algorithm were verified by the simulation test by assuming the port data,and the short-term dispatching mode and the medium-and long-term dispatching mode of the port were compared and demonstrated.

关 键 词：船舶进出港 全局调度优化 多约束条件 贪心-遗传优化算法 

分 类 号：U658.1[交通运输工程—港口、海岸及近海工程]