A Time Predefined Variable Depth Search for Nurse Rostering
A Time Predefined Variable Depth Search for Nurse Rostering
复制标题
DOI：
10.1287/ijoc.1120.0510
复制
发表时间：
2013-07
期刊：
影响因子：
--
通讯作者：
E. Burke;Timothy Curtois;R. Qu;G. V. Berghe
中科院分区：
文献类型：
--
作者：
E. Burke;Timothy Curtois;R. Qu;G. V. Berghe
本文提出了一种可变深度搜索的护士排班问题。该算法的工作原理是将单个邻域交换链接到一起，形成更有效的复合移动。它通过使用逻辑来决定是否继续扩展链以及将哪些候选项作为链中的下一个潜在链接进行检查。由于最终用户愿意等待解决方案的时间长短不同，因此本研究的一个特定目标是创建一种算法，该算法接受用户指定的计算时间限制并有效地使用它。与以前发表的方法相比，结果表明，该算法是非常有竞争力的。
This paper presents a variable depth search for the nurse rostering problem. The algorithm works by chaining together single neighbourhood swaps into more effective compound moves. It achieves this by using heuristics to decide whether to continue extending a chain and which candidates to examine as the next potential link in the chain. Because end users vary in how long they are willing to wait for solutions, a particular goal of this research was to create an algorithm that accepts a user specified computational time limit and uses it effectively. When compared against previously published approaches the results show that the algorithm is very competitive.