摘要
针对堆场集装箱预翻箱问题,提出对应的启发式算法,根据堆场实际情况,在考虑单个贝内集装箱服务的船舶数,再依次考虑目的港、重量这两个因素的基础上,建立了时空网络模型.随着贝内集装箱数目的增加,预翻箱问题变成一个NP-Hard问题,时空网络模型难以求解,因此又提出了对应的启发式算法,并证明了其在计算时间上的压缩.通过对贝内最优层高差进行研究,发现当相邻集装箱的层高差为2时,可以优化集装箱的预翻箱操作.
The number of ships, the port of destination and the weight of export containers are considered in turn in the time and space network model according to the actual circumstance of the yard. The pre-marshalling turns to a NP-Hard problem when the size of bay becomes large, and it is hard to solve the problem by the time and space network model. So a corresponding heuristic algorithm is proposed and the study shows that the heuristic algorithm could save the solution time. It is also found that when the high difference of adjacent stacks is 2, the operation of pre-marshalling will be optimized by research of the best high difference of adjacent stacks in a single bay.
出处
《辽宁工程技术大学学报（自然科学版）》
CAS
北大核心
2014年第3期405-408,共4页
Journal of Liaoning Technical University (Natural Science)
基金
国家自然科学基金资助项目(71171129)
上海市科委科研计划资助项目(111510501900
12dz1124802)
上海市教委科研资助项目(11YZ137)
关键词
预翻箱
网络模型
服务船舶数
目的港
重量
时空网络模型
启发式算法
层高差
pre-marshalling
network model
number of ships
port of destination
weight of containers
network model
heuristic algorithm
high difference of adjacent stacks
