Haibing Li
ABSTRACT
This paper presents a hybrid AI approach for a class of overconstrained 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 improved 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.
- H.; Li, A.; Lim, and B. Cheang. Algorithms for nurse rostering problems: A survey. Submitted for publication, 2001.Google Scholar
- K.; Heus and G. Weil. Constraint programming a nurse scheduling application. In Proceedings of the Second International Conference on the Practical Application of Constraint Technology, pages 115--127, 1996.Google Scholar
- V. Kumar. Algorithms for constraint satisfaction problems: A survey. AI Magazine, 13(1):32--44, 1992. Google ScholarDigital Library
- E. C.; Freuder and R. J. Wallace. Partial constraint satisfaction. Artificial Intelligence, 58(1--3):21--70, 1992. Google ScholarDigital Library
- A.; Borning, F-B.; Bjorn, and M. Wilson. Constraint hierarchies. Lisp and Symbolic Computation, 5(3):223--270, 1992. Google ScholarDigital Library
- H. Meyer auf'm Hofe. Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies. In E. C. Freuder and R. J. Wallace, editors, Constraint Programming and Large Scale Discrete Optimization, volume 57 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, pages 67--99. DIMACS, 2001. Google ScholarDigital Library
- R.; Dechter and D. Frost. Backtracking algorithms for constraint satisfaction problems, 1999.Google Scholar
- F.; Bacchus and A. Grove. Looking forward in constraint satisfaction algorithms, 1999.Google Scholar
- R.; Dechter and J. Pearl. Tree clustering for constraint networks. Artificial Intelligence, 38:353--366, 1989. Google ScholarDigital Library
- F.; Bacchus and P. van Beek. On the conversion between non-binary and binary constraint satisfaction problems. In AAAI'1998, pages 311--318, 1998. Google ScholarDigital Library
- K.; Stergiou and T. Walsh. Encodings of non-binary constraint satisfaction problems. In AAAI'1999, 1999. Google ScholarDigital Library
Recommendations
A hybrid evolutionary approach to the nurse Rostering problem
Nurse rostering is an important search problem with many constraints. In the literature, a number of approaches have been investigated including penalty function methods to tackle these constraints within genetic algorithm frameworks. In this paper, we ...
A Memetic Approach to the Nurse Rostering Problem
Constructing timetables of work for personnel in healthcare institutions is known to be a highly constrained and difficult problem to solve. In this paper, we discuss a commercial system, together with the model it uses, for this rostering problem. We ...
Iterated local search in nurse rostering problem
SoICT '13: Proceedings of the 4th Symposium on Information and Communication TechnologyThis paper presents how to solve a nurse rostering problem over the real datasets of Centre hospitalier régional de Trois-Rivières hospital in Canada. Due to the complexity of this problem with plenty of hard constraints, we propose an advanced Iterated ...
Comments