Skip to main content

Research Repository

See what's under the surface

Advanced Search

BOA for nurse scheduling

Li, Jingpeng; Aickelin, Uwe

Authors

Jingpeng Li jpl@cs.nott.ac.uk

Uwe Aickelin uwe.aickelin@nottingham.ac.uk



Contributors

Martin Pelikan
Editor

Kumara Sastry
Editor

Erick Cantú-Paz
Editor

Abstract

Our research has shown that schedules can be built mimicking a human scheduler by using a set of rules that involve domain knowledge. This chapter presents a Bayesian Optimization Algorithm (BOA)for the nurse scheduling problem that chooses such suitable scheduling rules from a set for each nurse’s assignment.
Based on the idea of using probabilistic models, the BOA builds a Bayesian network for the set of promising solutions and samples these networks to generate new candidate solutions. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed algorithm may be suitable for other scheduling problems.

Publication Date Jan 1, 2006
Peer Reviewed Peer Reviewed
Volume 33
Issue 33
Series Title Studies in computational intelligence
Book Title Scalable optimization via probabilistic modeling: from algorithms to applications
ISBN 9783540349532
APA6 Citation Li, J., & Aickelin, U. (2006). BOA for nurse scheduling. In K. Sastry, M. Pelikan, & E. CantĂș-Paz (Eds.), Scalable optimization via probabilistic modeling: from algorithms to applicationsSpringer
Copyright Statement Copyright information regarding this work can be found at the following address: http://eprints.nottingh.../end_user_agreement.pdf

Files

li2006.pdf (329 Kb)
PDF

Copyright Statement
Copyright information regarding this work can be found at the following address: http://eprints.nottingham.ac.uk/end_user_agreement.pdf





You might also like



Downloadable Citations

;