Abstract This paper is a note on [Quispe, K. E. Y., Lintzmayer, C. N., & Xavier, E. C. (2018). An exact algorithm for the blocks relocation problem with new lower bounds. Computers & Operations Research, 99, 206–217]. Quispe et al. (2018) presented a new lower bound called LB-LIS for the blocks relocation problem. In this note, we show that the algorithm description of LB-LIS in the referred paper is incomplete. In addition, we propose a faster algorithm for computing this lower bound more efficiently. Computational experiments on a commonly used dataset reveal that the proposed algorithm uses on average 44.48% less time than the original LB-LIS implementation for the instances tested.

中文翻译：

---

关于“具有新下界的块重定位问题的精确算法”的注释

摘要 本文是对 [Quispe, KEY, Lintzmayer, CN, & Xavier, EC (2018) 的注释。具有新下界的块重定位问题的精确算法。计算机与运筹学，99, 206-217]。奎斯佩等人。(2018) 为块重定位问题提出了一个称为 LB-LIS 的新下界。在本说明中，我们表明参考论文中 LB-LIS 的算法描述是不完整的。此外，我们提出了一种更快的算法来更有效地计算这个下界。对常用数据集的计算实验表明，对于所测试的实例，所提出的算法使用的时间平均比原始 LB-LIS 实现少 44.48%。