Advertisement

Annals of Operations Research

, Volume 155, Issue 1, pp 289–309 | Cite as

An estimation of distribution algorithm for nurse scheduling

  • Uwe Aickelin
  • Jingpeng LiEmail author
Article

Abstract

Schedules can be built in a similar way to a human scheduler by using a set of rules that involve domain knowledge. This paper presents an Estimation of Distribution Algorithm (EDA) for the nurse scheduling problem, which involves choosing a suitable scheduling rule from a set for the assignment of each nurse. Unlike previous work that used Genetic Algorithms (GAs) to implement implicit learning, the learning in the proposed algorithm is explicit, i.e. we identify and mix building blocks directly. The EDA is applied to implement such explicit learning by building a Bayesian network of the joint distribution of solutions. The conditional probability of each variable in the network is computed according to an initial set of promising solutions. Subsequently, each new instance for each variable is generated by using the corresponding conditional probabilities, until all variables have been generated, i.e. in our case, a new rule string has been obtained. Another set of rule strings will be generated in this way, some of which will replace previous strings based on fitness selection. If stopping conditions are not met, the conditional probabilities for all nodes in the Bayesian network are updated again using the current set of promising rule strings. Computational results from 52 real data instances demonstrate the success of this approach. It is also suggested that the learning mechanism in the proposed approach might be suitable for other scheduling problems.

Keywords

Estimation of distribution algorithms Bayesian network Nurse scheduling 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aickelin, U. (2002). An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, 53, 1118–1126. CrossRefGoogle Scholar
  2. Aickelin, U., & Dowsland, K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3, 139–153. CrossRefGoogle Scholar
  3. Aickelin, U., & Dowsland, K. (2002). Enhanced direct and indirect genetic algorithm approaches for a mall layout and tenant selection problem. Journal of Heuristics, 8, 503–514. CrossRefGoogle Scholar
  4. Aickelin, U., & Dowsland, K. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research 31, 761–778. CrossRefGoogle Scholar
  5. Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128, 159–177. CrossRefGoogle Scholar
  6. Bellanti, F., Carello, G., Della Croce, F., & Tadei, R. (2004). A greedy-based neighborhood search approach to a nurse rostering problem. European Journal of Operational Research, 153, 28–40. CrossRefGoogle Scholar
  7. Burke, E. K., De Causmaecker, P., & Vanden Berghe, G. (1999). A hybrid tabu search algorithm for the nurse rostering problem. In B. McKay et al. (Eds.), Lecture Notes in Artificial Intelligence : Vol. 1585. Simulated evolution and learning (pp. 187–194). Berlin: Springer. Google Scholar
  8. Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199–214. CrossRefGoogle Scholar
  9. Burke, E. K., De Causmaecker, P., Vanden Berghe, G., & Van Landeghem, H. (2004). The state of the art of nurse rostering. Journal of Scheduling, 7, 441–499. CrossRefGoogle Scholar
  10. Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems—a bibliographic survey. European Journal of Operational Research, 151, 447–460. CrossRefGoogle Scholar
  11. De Bonet, J. S., Isbell, C. L., & Viola, P. (1997). MIMC: finding optima by estimating probability densities. In M. C. Mozer et al. (Eds.), Advances in neural information processing systems (pp. 424). Cambridge: MIT Press. Google Scholar
  12. Dowsland, K. A., & Thompson, J. M. (2000). Solving a nurse scheduling with knapsacks, networks and tabu search. Journal of Operational Research Society, 51, 825–833. CrossRefGoogle Scholar
  13. Edwards, D. (2000). Introduction to graphical modelling (2nd ed.). Berlin: Springer. Google Scholar
  14. Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley. Google Scholar
  15. Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In M. Jordan (Ed.), Learning in graphical models. Cambridge: MIT Press. Google Scholar
  16. Holland, J. H. (1975). Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence. University of Michigan Press. Google Scholar
  17. Isken, M. W., & Hancock, W. (1991). A heuristic approach to nurse scheduling in hospital units with non-stationary, urgent demand, and a fixed staff size. Journal of the Society for Health Systems, 2, 24–41. Google Scholar
  18. Jan, A., Yamamoto, M., & Ohuchi, A. (2000). Evolutionary algorithms for nurse scheduling problems. In Proceedings of the 2000 congress on evolutionary computation, San Diego (pp. 196–203). Google Scholar
  19. Jaszkiewicz, A. (1997). A metaheuristic approach to multiple objective nurse scheduling. Foundations of Computing and Decision Sciences, 22, 169–184. Google Scholar
  20. Jordan, M. I. (Ed.) (1999). Learning in graphical models. Cambridge: MIT Press. Google Scholar
  21. Larranaga, P., & Lozano, J. A. (2001). Estimation of distribution algorithms. Dordrecht: Kluwer Academic. Google Scholar
  22. Mühlenbein, H., & Mahnig, T. (1999). FDA—a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7, 45–68. Google Scholar
  23. Pearl, J. (1998). Probabilistic reasoning in intelligent systems: networks of plausible inference. Los Altos: Morgan Kaufmann. Google Scholar
  24. Pelikan, M., & Goldberg, D. (2000). Research on the Bayesian optimization algorithms (IlliGAL report No 200010). University of Illinois. Google Scholar
  25. Pelikan, M., Goldberg, D., & Cantu-Paz, E. (1999). BOA: the Bayesian optimization algorithm (IlliGAL report No 99003). University of Illinois. Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2007

Authors and Affiliations

  1. 1.School of Computer Science and Information TechnologyUniversity of NottinghamNottinghamUK

Personalised recommendations