基于改进遗传算法的泊位分配问题  

Berth Allocation Problem Based on Improved Genetic Algorithm

作　　者：童蕴之 段亚星 

机构地区：[1]东南大学自动化学院,江苏南京210096

出　　处：《工业控制计算机》2023年第12期27-28,31,共3页Industrial Control Computer

摘　　要：泊位是船舶进出港调度中的重要组成部分。集装箱港口的泊位分配问题(BAP)是为到达集装箱港口的船舶安排最佳停靠位置和时间。考虑船舶动态到达的情况以及码头装卸效率对船舶在港作业时间的影响。以船舶的总在港时间最短为目标,包括船舶的等待时间和作业时间,建立了连续型泊位分配问题的求解策略。根据“先来先服务”的原则,构建了混合整数规划模型,并采用改进的遗传算法对其进行求解。经过算例结果的验证,该模型和算法被证明具有正确性和有效性,可以找到更符合实际情况的泊位分配策略。The berth is an important component of ship scheduling for arrivals and departures.The berth allocation problem(BAP)in container ports is to arrange the optimal berthing position and time for ships arriving at the container port.This paper considers the dynamic arrival of ships and the impact of terminal efficiency on the operation time of ships in port.A solution strategy for the continuous berth allocation problem is established to minimize the total time of ships in port,including waiting and operation times.A mixed integer programming model is constructed based on first-come-first-served principle,and an improved genetic algorithm is used to solve the model.

关 键 词：连续型泊位分配 遗传算法 优化模型 先来先服务原则 

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