集装箱船全航线智能预配问题研究

A Research on Intelligent Pre-stowage Planning Problem for Containerships in Full Routes

针对挂靠多港口集装箱船的全航线预配问题,以倒箱量最少、船舶纵向强度最优为目标,提出该问题的0-1整数规划模型.利用基于规则的方法,并分别采用混合整数规划算法、蚁群算法和遗传算法求解之.结果表明,在待配载箱数较少时,混合整数规划算法快速,且得到的解为最优解.给出了基于以上三种算法及一定的装箱规则的全航线智能配载算法.采用该算法模拟计算得出了8Bay集装箱船全航线智能预配结果,保证了倒箱量为0,且考虑到了纵向强度目标,即集装箱重心距离船舯的距离最小.

In order to solve the pre-planning problem for containerships in full routes using an intelli- gent way, a 0--1 integer programming for the problem is put forward by setting the number of shift and ship longitudinal bending moment value as goals. By the rule based methods, the problem is solved by the Mixed Integer Programming Algorithm （MIPA）, Ant Colony Algorithm （ACA） and Genetic Algorithm （GA）, respectively. It shows that when the scale of the problem is small, the MI- PA is very efficient, and the optimal solution can be found by it. An intelligent algorithm for pre-plan- ning problem of containerships in full routes based on the MIPA, ACA and GA is given, respectively. Finally, the pre-planning result of a containership with 8 bays is shown, it assures that the number of shift is zero, and the ship longitudinal bending moment value is considered as the objective, which means the longitudinal offsets of the center of gravity is minimized.