人工神经网络辅助树搜索在人员排班问题中的应用
Neural Networked Assisted Tree Search for the Personnel Rostering Problem
摘要:
人员花名册问题是一个问题,找到一个最佳的方式来分配员工轮班,受到一组硬约束,所有有效的解决方案必须遵循,和一组软约束,定义了有效的解决方案的相对质量。这个问题已经得到了显着的关注,在文献中,并解决了大量的精确和元启发式方法。为了使人员排班问题的复杂和昂贵的算法设计自动化,我们提出了一种结合深度神经网络和树搜索的新方法。通过将时间表视为矩阵,神经网络可以预测当前解与最优解之间的距离。它可以通过分析现有的(近)最佳解决方案的人员排班问题的实例选择解决方案的策略。结合分支定界,网络可以给每个节点一个概率,表明它与最优节点之间的距离,以便在下一个选择哪个分支上做出明智的选择,并修剪搜索树。
英文摘要:
The personnel rostering problem is the problem of finding an optimal way to assign employees to shifts, subject to a set of hard constraints which all valid solutions must follow, and a set of soft constraints which define the relative quality of valid solutions. The problem has received significant attention in the literature and is addressed by a large number of exact and metaheuristic methods. In order to make the complex and costly design of heuristics for the personnel rostering problem automatic, we propose a new method combined Deep Neural Network and Tree Search. By treating schedules as matrices, the neural network can predict the distance between the current solution and the optimal solution. It can select solution strategies by analyzing existing (near-)optimal solutions to personnel rostering problem instances. Combined with branch and bound, the network can give every node a probability which indicates the distance between it and the optimal one, so that a well-informed choice can be made on which branch to choose next and to prune the search tree.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。