基于改进蛙跳算法的码头三阶段联合调度优化  

Optimization of terminal three-stage joint dispatching based on improved shuffled frog leaping algorithm

作　　者：陶振东 钟祾充 贺利军 Tao Zhendong;Zhong Lingchong;He Lijun

机构地区：[1]武汉理工大学交通与物流工程学院,武汉430063

出　　处：《起重运输机械》2025年第2期37-44,共8页Hoisting and Conveying Machinery

摘　　要：自动化集装箱码头装卸作业包括岸边集装箱起重机(QC)作业、自动导引小车(AGV)水平运输以及集装箱门式起重机(YC)作业3个作业阶段。文中针对QC-AGV-YC三阶段联合调度问题,考虑各作业阶段的能耗,构建了以最小化总能耗和最小化总作业完成时间为目标的混合整数规划模型。为求解模型,针对问题特征,引入新的编解码策略和快速非支配排序策略,提出了一种改进的多目标离散蛙跳算法(DMOSFLA)。另外,改进了跳跃策略,以更好地搜索离散解空间。最后,设计不同规模的算例,将DMOSFLA算法与其他算法进行比较。结果表明,DMOSFLA算法在求解三阶段联合调度问题时具有更好的寻优能力以及求解质量,能够为码头管理者提供满足不同需求的调度方案,提高了码头调度的灵活性。Automatic container terminal loading and unloading operations can be divided into three stages:quayside container crane(QC)operation,automatic guided vehicle(AGV)horizontal transportation and container gantry crane(YC)operation.Regarding the three-stage joint dispatching of QC-AGV-YC,considering the energy consumption of each operation stage,a mixed integer programming model with the goal of minimizing the total energy consumption and the total job completion time was constructed.To solve this model,an improved discrete multi-objective shuffled frog leaping algorithm(DMOSFLA)was proposed by introducing a new coding and decoding strategy and a fast non-dominated sorting strategy.In addition,the leaping strategy was improved to search the discrete solution space better.Finally,examples of different scales were designed to compare DMOSFLA with other algorithms.The results show that DMOSFLA has better optimization ability and solution quality in solving the three-stage joint dispatching problem,and can provide dispatching proposals for terminal managers to meet different needs,thus improving the flexibility of terminal dispatching.

关 键 词：自动化集装箱码头 三阶段联合调度 多目标优化 改进的多目标离散蛙跳算法 

分 类 号：TH247[机械工程—机械制造及自动化] U656.1[交通运输工程—港口、海岸及近海工程]