A hybrid AI approach for nurse rostering problem

Document Type

Conference Proceeding

Publication Date

1-1-2003

Abstract

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.

Identifier

0038336820 (Scopus)

Publication Title

Proceedings of the ACM Symposium on Applied Computing

External Full Text Location

https://doi.org/10.1145/952532.952675

First Page

730

Last Page

735

This document is currently not available here.

Share

COinS