.png){kind=icon}
返回
An efficient ant colony optimization algorithm for the blocks relocation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.09.038.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present an ant colony optimization (ACO) algorithm for the Blocks Relocation Problem (BRP). The method is applied to both versions of the problem most commonly considered in literature, i.e., the restricted (rBRP) and the unrestricted (uBRP) BRP with distinct due dates. In case of the uBRP a new heuristic is proposed and incorporated in a standard greedy algorithm. The performance of the basic greedy approach is enhanced by extending it to the ACO metaheuristic. In it, a novel approach for defining the pheromone matrix is proposed. More precisely, it only stores a small amount of information instead of the complete bay state. Further, we show that the proposed ACO method can easily be adapted for solving the BRP in which the objective function is related to the crane operation time. Our computational results show that the proposed approach manages to outperform existing methods for the BRP. (C) 2018 Elsevier B.V. All rights reserved.
Keyword:
Heuristics
Maritime shipping
Blocks relocation problem
Stowage plan
Heuristics
Ant colony optimization
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
An optimisation model and its effective beam search heuristics for floor-storage warehousing systems
.png){kind=icon}
PREAI
分享收藏
分享收藏分享收藏分享收藏
查看更多内容