A variable neighborhood search based matheuristic for nurse rostering problems
A variable neighborhood search based matheuristic for nurse rostering problems
复制标题
DOI：
10.1007/s10479-012-1235-x
复制
发表时间：
2012-11
影响因子：
4.8
通讯作者：
Federico Della Croce;F. Salassa
中科院分区：
文献类型：
--
作者：
Federico Della Croce;F. Salassa
被认为是一个实际的护士排班问题，出现在一个病房的意大利私立医院。在这个问题上，每个月都需要根据各种要求为护理人员分配班次。介绍了一种数学方法，基于一组邻域迭代搜索的商业整数规划求解器在一个定义的全球时限内，依赖于一个启动的解决方案所产生的求解器上运行的一般整数规划制定的问题。一般来说，数学算法是一种启发式算法，它使用非平凡优化和数学规划工具来探索解空间，目的是分析大规模邻域。随机生成的实例，考虑护士排班问题的基础上，解决和解决方案计算所提出的程序相比，在相同的时间限制内实现的解决方案由纯求解器。结果表明，所提出的解决方案的方法优于解决方案的质量。所提出的方法也进行了测试，在著名的护士排班比赛的情况下，几个新的最佳结果达到。
A practical nurse rostering problem, which arises at a ward of an Italian private hospital, is considered. In this problem, it is required each month to assign shifts to the nursing staff subject to various requirements. A matheuristic approach is introduced, based on a set of neighborhoods iteratively searched by a commercial integer programming solver within a defined global time limit, relying on a starting solution generated by the solver running on the general integer programming formulation of the problem. Generally speaking, a matheuristic algorithm is a heuristic algorithm that uses non trivial optimization and mathematical programming tools to explore the solutions space with the aim of analyzing large scale neighborhoods. Randomly generated instances, based on the considered nurse rostering problem, were solved and solutions computed by the proposed procedure are compared to the solutions achieved by pure solvers within the same time limit. The results show that the proposed solution approach outperforms the solvers in terms of solution quality. The proposed approach has also been tested on the well known Nurse Rostering Competition instances where several new best results were reached.