.png){kind=icon}
返回
A heuristic for retrieving containers from a yard
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2009.10.005.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper presents a three-phase heuristic to solve for an optimized working plan for a crane to retrieve all the containers from a given yard according to a given order. The optimization goal is to minimize the number of container movements, as well as the crane's working time. After generating an initial feasible movement sequence, the second phase reduces the length of the sequence by repeatedly formulating and generating a binary integer program. With another mixed integer program, phase three reduces the crane's working time by adjusting the movement sequence through iterations. Numerical testing results show that the heuristic is able to solve instances with more than 700 containers, which is within the range of real-world applications. Moreover, the number of movements approaches the lower bound in most cases, and the resulting movement sequence is efficient. (C) 2009 Elsevier Ltd. All rights reserved.
Keyword:
Container terminal
Container retrieval
Integer programming
Neighborhood search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
没有更多内容
没有更多内容