中文摘要：

针对现实约束下的船舶装箱排序问题,利用整数规划方法,以最小化装船时间以及翻倒箱时间成本为目标,构建了该问题的数学模型.利用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 at minimizing the loading time and overstowing time cost.According to three kinds of container sending rules,exact solutions of the cases in different scales of the problem can be obtained by using ILOG CPLEX and branch bound algorithm.In addition,some obvious characteristics of the speed and quality of the solutions are discovered.The experiment results show that this model is effective and the cases in medium and small scales of the problem can be solved.