.png){kind=icon}
返回
A feasibility-based heuristic for the container pre-marshalling problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2016.05.061.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper addresses the container pre-marshalling problem (CPMP) which rearranges containers inside a storage bay to a desired layout. By far, target-driven algorithms have relatively good performance among all algorithms; they have two key components: first, containers are rearranged to their desired slots one by one in a certain order; and second, rearranging one container is completed by a sequence of movements. Our paper improves the performance of the target-driven algorithm from both aspects. The proposed heuristic determines the order of container rearrangements by the concepts of state feasibility, container stability, dead-end avoidance and tier-protection proposed in this paper. In addition, we improve the efficiency of performing container rearrangements by discriminating different task types. Computational experiments showcase that the performance of the proposed heuristic is considerable. (C) 2016 Elsevier B.V. All rights reserved.
Keyword:
Container pre-marshalling problem
Feasibility-based heuristic
Tier-protection
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Storage yard operations in container terminals: Literature overview, trends, and research directions
OAAI
OAAI分享收藏
分享收藏分享收藏A follow-up survey of berth allocation and quay crane scheduling problems in container terminals
PREAI
分享收藏
查看更多内容