论文部分内容阅读
针对堆场集装箱预翻箱问题,提出对应的启发式算法,根据堆场实际情况,在考虑单个贝内集装箱服务的船舶数,再依次考虑目的港、重量这两个因素的基础上,建立了时空网络模型.随着贝内集装箱数目的增加,预翻箱问题变成一个NP-Hard问题,时空网络模型难以求解,因此又提出了对应的启发式算法,并证明了其在计算时间上的压缩.通过对贝内最优层高差进行研究,发现当相邻集装箱的层高差为2时,可以优化集装箱的预翻箱操作.
According to the actual situation of the yard, based on the two factors of the port of destination and the weight, taking into account the number of ships serviced by a single Benevental container, and based on the two factors of the destination port and the weight, With the increase of the number of containers in Beneteau, the problem of the pre-turning into an NP-Hard problem, the space-time network model is difficult to solve, so we put forward the corresponding heuristic algorithm, and proved its computing time Compression.By studying the optimal shell height difference in Bayei, it is found that the pre-roll operation of the container can be optimized when the layer difference of adjacent containers is two.