A Hybrid AI Approach for Nurse Rostering Problem
Conference Proceeding Article
This paper presents a hybrid AI approach for a class of over-constrained Nurse Rostering Problems. Our approach comes in two phases. The first phase solves a relaxed version of problem which only includes hard rules and part of nurses' requests for shifts. This involves using a forward checking algorithm with non-binary constraint propagation, variable ordering, random value ordering and compulsory backjumping. In the second phase, adjustments with descend local search and tabu search are applied to improve the solution. This is to satisfy the preference rules as far as possible. Experiments show that our approach is able to solve this class of problems well.
Algorithms, Constraint theory, Problem solving, Random processes, rostering
Health and Medical Administration | Operations and Supply Chain Management
SAC '03: Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, FL, USA, 9-12 March 2003
City or Country
LI, Haiping; LIM, Andrew; and RODRIGUES, Brian.
A Hybrid AI Approach for Nurse Rostering Problem. (2003). SAC '03: Proceedings of the 2003 ACM Symposium on Applied Computing, Melbourne, FL, USA, 9-12 March 2003. 730-735. Research Collection Lee Kong Chian School Of Business.
Available at: http://ink.library.smu.edu.sg/lkcsb_research/2070