基于指派问题的Bay位排箱优化模型与算法

Model and algorithm of Bay layout for containership based on assignment problem

提出了解决集装箱船全航线配载问题的分解算法,将配载问题分解为Bay位选择和Bay位中集装箱箱位指定两个子问题.主要研究了Bay位中装载同一目的港集装箱时,不同重量集装箱在Bay位中的排箱方法.以重心高度最低、横倾力矩最小为目标建立优化模型,将Bay位中不同重量集装箱排箱问题看成是箱位指派问题,采用禁忌搜索算法求解.实际模拟结果表明该方法可行,为集装箱船全航线配载优化提供了一个实用的优化模型.

A decomposed method of containership stowage plan in full route is put forward,which is selection of bays and sorting of containers in bays.As space is limited,the main focus is how to sort the containers of different weights belonging to the same port in the bay.Optimization model is established based on the objective functions of minimizing the metacentric height and heel moment,and the sort of containers of different weights is regarded as assignment problem,and tabu search algorithm is used to solve this problem.A case certifies the feasibility of the model and algorithm.The model for container stowage problem is practical and optimal.