A stochastic beam search for the berth allocation problem
A stochastic beam search for the berth allocation problem
复制标题
DOI：
10.1016/j.dss.2006.06.008
复制
发表时间：
2007
期刊：
影响因子：
--
通讯作者：
Fan Wang;A. Lim
中科院分区：
文献类型：
--
作者：
Fan Wang;A. Lim
本文将泊位分配优化问题转化为多阶段决策问题，提出了一种新的多阶段搜索方法--随机波束搜索算法，并提出了改进的波束搜索方案、两阶段节点优度估计和随机节点选择准则等新技术。我们收集了新加坡港口提供的真实信息作为我们的测试数据。实验结果表明，所提出的随机波束搜索是更准确和更有效的比国家的最先进的元启发式和传统的确定性波束搜索。
In this paper, the optimization of the Berth Allocation Problem (BAP) is transformed into a multiple stage decision making procedure and a new multiple stage search method, namely stochastic beam search algorithm, is proposed to solve it. New techniques such as an improved beam search scheme, a two-phase node goodness estimation, and a stochastic node selection criteria are proposed. Real-life information provided by Singapore Port was collected as our test data. Experimental results show that the proposed stochastic beam search is more accurate and efficient than both the state-of-the-art meta-heuristic and the traditional determinist beam search.