.png){kind=icon}
返回
Heuristic algorithm for retrieving containers
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2016.08.022.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study proposes a heuristic algorithm to achieve efficient container retrieval given a specified order, by minimizing the number of container movements and the working time of the crane. We evaluated our proposed algorithm by solving 70 sample problems. The results confirmed the validity and efficiency of the algorithm compared to methods used in previous research. Our algorithm succeeds in reducing the number of container movements and the working time of the crane. Furthermore, the heuristic algorithm is computationally efficient and greatly reduces the amount of time required to obtain a solution. Therefore, we expect our heuristic to be useful in the real-world industry where rapid decision making is required. (C) 2016 Published by Elsevier Ltd.
Keyword:
Container retrieval
Heuristic
Container terminal
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容