论文标题
块搬迁问题的有界光束搜索算法
The Bounded Beam Search algorithm for the Block Relocation Problem
论文作者
论文摘要
在本文中，我们处理了受限的块搬迁问题。我们为问题提供了一种新的下限和一种启发式方法。所提出的下限可以在多项式时间内计算，并且证明比以前已知的下限要好得多。我们在界面搜索算法中使用它来解决块重新定位问题，并表明所考虑的启发式方法在文献中的大多数实例上都优于其他现有算法。为了测试实际尺寸维度的方法，还引入了块重定位问题的新大型实例。
In this paper we deal with the restricted Block Relocation Problem. We present a new lower bound and a heuristic approach for the problem. The proposed lower bound can be computed in polynomial time and it is provably better than some previously known lower bounds. We use it within a bounded beam search algorithm to solve the Block Relocation Problem and show that the considered heuristic approach outperforms the other existing algorithms on most of the instances in the literature. In order to test the approaches on real-size dimensions, new large instances of the Block Relocation Problem are also introduced.
