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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aickelin, U. (2002). An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, 53, 1118–1126.
Aickelin, U., & Dowsland, K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3, 139–153.
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.
Aickelin, U., & Dowsland, K. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research 31, 761–778.
Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128, 159–177.
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.
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.
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.
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.
Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems—a bibliographic survey. European Journal of Operational Research, 151, 447–460.
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.
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.
Edwards, D. (2000). Introduction to graphical modelling (2nd ed.). Berlin: Springer.
Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley.
Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In M. Jordan (Ed.), Learning in graphical models. Cambridge: MIT Press.
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.
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.
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).
Jaszkiewicz, A. (1997). A metaheuristic approach to multiple objective nurse scheduling. Foundations of Computing and Decision Sciences, 22, 169–184.
Jordan, M. I. (Ed.) (1999). Learning in graphical models. Cambridge: MIT Press.
Larranaga, P., & Lozano, J. A. (2001). Estimation of distribution algorithms. Dordrecht: Kluwer Academic.
Mühlenbein, H., & Mahnig, T. (1999). FDA—a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7, 45–68.
Pearl, J. (1998). Probabilistic reasoning in intelligent systems: networks of plausible inference. Los Altos: Morgan Kaufmann.
Pelikan, M., & Goldberg, D. (2000). Research on the Bayesian optimization algorithms (IlliGAL report No 200010). University of Illinois.
Pelikan, M., Goldberg, D., & Cantu-Paz, E. (1999). BOA: the Bayesian optimization algorithm (IlliGAL report No 99003). University of Illinois.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Aickelin, U., Li, J. An estimation of distribution algorithm for nurse scheduling. Ann Oper Res 155, 289–309 (2007). https://doi.org/10.1007/s10479-007-0214-0
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-007-0214-0