.png){kind=icon}
返回
An exact approach to the restricted block relocation problem based on a new integer programming formulation
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2021.03.062.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This study addresses the block(s) relocation problem (BRP), also known as the container relocation problem. This problem considers individually retrieving blocks piled up in tiers according to a predetermined order. When the block to be retrieved next is not at the top, we have to relocate the blocks above it because we can access only the topmost blocks. The objective is to retrieve all the blocks with the smallest number of relocations. In this study, a novel exact algorithm is proposed for the restricted BRP, a class of the problem where relocatable blocks are restricted. The proposed algorithm computes lower and upper bounds iteratively by solving the corresponding integer programming problems until the optimality gap is reduced to zero. The novelty of the algorithm lies in the formulations based on complete and truncated relocation sequences of the individual blocks. We examine the effectiveness of the proposed algorithm through computational experiments for benchmark instances from the literature. In particular, we report that, for the first time, all the instances with up to 100 blocks are solved to proven optimality. (c) 2021 Elsevier B.V. All rights reserved.
Keyword:
OR in maritime industry
Combinatorial optimization
Block relocation problem
Integer programming
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
分享收藏An efficient ant colony optimization algorithm for the blocks relocation problem一种求解街区搬迁问题的高效蚁群优化算法
PREAI
分享收藏分享收藏A new effective unified model for solving the Pre-marshalling and Block Relocation Problems解决预编组和块重定位问题的一种新的有效统一模型
OAAI
OAAI分享收藏
查看更多内容