中文摘要：

针对现实约束下的船舶装箱排序问题,利用整数规划方法,以最小化横倾力矩为目标,构建该问题的数学模型。开发3阶段的启发式算法,基于规则构建预配载方案,进行集装箱互换,搜索优化解。对小规模案例和不同规模实际案例进行仿真试验,结果表明启发式算法均能在0.1s内获得船舶实配约束下装箱排序问题的解。同时,通过与IBM ILOG CPLEX中分支定界算法的精确解求解情况进行对比,验证模型及优化算法的有效性和实用性。

英文摘要：

In order to solve the sequencing and bin packing problem with practical vessel stowage constraints,a mathematical model of the problem is constructed based on integer programming method,which aims to minimizing the heel moment.A three-phase heuristics algorithm is developed,which makes a tentative stowage plan according to given rules first,and then find the optimum solution by interchanging containers.Simulations of actual stowage cases show that the problems can be solved within 0.1 s regardless the scale of the problem.Effectiveness and practicality of the model and optimal algorithm are verified through comparison with the exact solutions obtained by the branch bound algorithm from IBM ILOG CPLEX.