护士排班问题的约束导向局部搜索算法
A Constraint-directed Local Search Approach to Nurse Rostering Problems
摘要:
在本文中,我们调查的杂交约束规划和局部搜索技术在一个大的邻域搜索方案解决高度约束的护士排班问题。正如研究所确定的那样,大型邻域搜索的一个关键部分是选择片段(邻域,即变量集),以迭代方式放松和重新优化。大邻域搜索的成功取决于这个确定的邻域的充分性,关于有问题的部分的解决方案分配和邻域大小的选择。我们研究了三种策略来选择不同大小的片段内的大邻域搜索方案。前两种策略是针对问题的性质而定制的。第三种策略更一般,使用来自软约束违反及其传播的成本信息作为选择添加到片段中的变量的指标。三种策略进行了分析和比较后,一个基准护士排班问题。令人鼓舞的结果表明,在混合方法的未来工作的可能性。
英文摘要:
In this paper, we investigate the hybridization of constraint programming and local search techniques within a large neighbourhood search scheme for solving highly constrained nurse rostering problems. As identified by the research, a crucial part of the large neighbourhood search is the selection of the fragment (neighbourhood, i.e. the set of variables), to be relaxed and re-optimized iteratively. The success of the large neighbourhood search depends on the adequacy of this identified neighbourhood with regard to the problematic part of the solution assignment and the choice of the neighbourhood size. We investigate three strategies to choose the fragment of different sizes within the large neighbourhood search scheme. The first two strategies are tailored concerning the problem properties. The third strategy is more general, using the information of the cost from the soft constraint violations and their propagation as the indicator to choose the variables added into the fragment. The three strategies are analyzed and compared upon a benchmark nurse rostering problem. Promising results demonstrate the possibility of future work in the hybrid approach.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。