Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 34, Issue 3, Pages 642-666Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2005.03.018
Keywords
dynamic regional nurse scheduling; ant colony optimization (ACO); decision support system
Ask authors/readers for more resources
To the best of our knowledge, this paper describes the first ant colony optimization (ACO) approach applied to nurse scheduling, analyzing a dynamic regional problem which is currently under discussion at the Vienna hospital compound. Each day, pool nurses have to be assigned for the following days to public hospitals while taking into account a variety of soft and hard constraints regarding working date and time, working patterns, nurses qualifications, nurses' and hospitals' preferences, as well as costs. Extensive computational experiments based on a four week simulation period were used to evaluate three different scenarios varying the number of nurses and hospitals for six different hospitals' demand intensities. The results of our simulations and optimizations reveal that the proposed ACO algorithm achieves highly significant improvements compared to a greedy assignment algorithm. (c) 2005 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available