首页 | 本学科首页   官方微博 | 高级检索  
     


A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
Authors:Edmund K. Burke  Timothy Curtois  Gerhard Post  Rong Qu  Bart Veltman
Affiliation:1. School of Computer Science and Information Technology, University of Nottingham, Jubilee Campus, Wollaton Road, Nottingham NG8 1BB, UK;2. ORTEC, Groningenweg 6-33, 2803 PV Gouda, Holland, The Netherlands
Abstract:This paper is concerned with the development of intelligent decision support methodologies for nurse rostering problems in large modern hospital environments. We present an approach which hybridises heuristic ordering with variable neighbourhood search. We show that the search can be extended and the solution quality can be significantly improved by the careful combination and repeated use of heuristic ordering, variable neighbourhood search and back-tracking. The amount of computational time that is allowed plays a significant role and we analyse and discuss this. The algorithms are evaluated against a commercial Genetic Algorithm on commercial data. We demonstrate that this methodology can significantly outperform the commercial algorithm. This paper is one of the few in the scientific nurse rostering literature which deal with commercial data and which compare against a commercially implemented algorithm.
Keywords:Variable neighbourhood search   Heuristics and metaheuristics   Nurse rostering   Hybrid methods
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号