摘要
在集装箱堆场,翻箱操作不可避免,为降低翻箱次数,提高作业效率,有必要找到一种有效的方法来解决这一问题.在已知每个集装箱提箱顺序的前提下,如何安排翻箱作业顺序是典型的NP难问题.为此提出了一种启发式算法,并通过算例实验与已有算法的结果进行对比,实验结果表明本文提出的算法较优.
For many reasons, container relocation handling is inevitable in container yard. An effective decision process is necessary for the reduction of re-handling and improvement of the productivity. How to perform the re-handling procedure is NP hard problem when all container priority is known. To solve this problem, a heuristic algorithm is proposed, and experiments are conducted. The result of the experiments proves the validity of the algorithm.
出处
《河南科学》
2012年第12期1757-1760,共4页
Henan Science
基金
国家自然科学基金(71071093)
上海市自然科学基金(10ZR1413300)
上海市教委创新基金(11YZ136)
关键词
翻箱问题
集装箱堆场
启发式算法
relocation problem
container yard： heuristic algorithm
