论文部分内容阅读
综合考虑翻箱次数和桥吊的工作时间,建立以翻箱次数最小和桥吊工作时间跨度最小的整数规划模型,并且引入基于集装箱箱区的启发式算法和遗传算法对集装箱船实现配载。以具有6个挂靠港的2382个集装箱为例,在不同的松弛系数下,分别计算翻箱次数和桥吊的工作时间跨度。计算结果显示,不论是启发式算法和遗传算法,随着松弛系数的增大,翻箱次数和桥吊工作时间跨度呈现减小的趋势,但是不同桥吊相互干扰的可能性会增加。在相同松弛系数下,把启发式算法和遗传算法得到的结果进行比较,可知遗传算法得到的最优配载方案目标函数值更小,被选取为最终配载方案。
Considering the number of rollover cases and the working hours of bridge cranes, an integer programming model with the smallest number of rollovers and the smallest span of bridge cranes was established, and a heuristic algorithm and genetic algorithm based on container box were introduced to realize the loading of container ships. Taking 2382 containers with 6 ports of call as an example, under different relaxation factors, the number of rollover cases and the working span of bridge crane are calculated respectively. The calculation results show that both the heuristic algorithm and the genetic algorithm tend to reduce the number of rollover cases and the bridge crane working time span with the increase of the relaxation coefficient, but the possibility of mutual interference between different bridge cranes will increase. Under the same relaxation coefficient, the results obtained by heuristic algorithm and genetic algorithm are compared. It can be seen that the objective function of the optimal loading scheme obtained by genetic algorithm is smaller and is selected as the final loading scheme.