{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T16:46:02Z","timestamp":1770914762982,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,10]],"date-time":"2007-07-10T00:00:00Z","timestamp":1184025600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[2007,8,22]]},"DOI":"10.1007\/s10479-007-0214-0","type":"journal-article","created":{"date-parts":[[2007,7,16]],"date-time":"2007-07-16T23:21:53Z","timestamp":1184628113000},"page":"289-309","source":"Crossref","is-referenced-by-count":55,"title":["An estimation of distribution algorithm for nurse scheduling"],"prefix":"10.1007","volume":"155","author":[{"given":"Uwe","family":"Aickelin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jingpeng","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,7,10]]},"reference":[{"key":"214_CR1","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1057\/palgrave.jors.2601317","volume":"53","author":"U. Aickelin","year":"2002","unstructured":"Aickelin, U. (2002). An indirect genetic algorithm for set covering problems. Journal of the Operational Research Society, 53, 1118\u20131126.","journal-title":"Journal of the Operational Research Society"},{"key":"214_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1002\/(SICI)1099-1425(200005\/06)3:3<139::AID-JOS41>3.0.CO;2-2","volume":"3","author":"U. Aickelin","year":"2000","unstructured":"Aickelin, U., & Dowsland, K. (2000). Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. Journal of Scheduling, 3, 139\u2013153.","journal-title":"Journal of Scheduling"},{"key":"214_CR3","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1023\/A:1016536623961","volume":"8","author":"U. Aickelin","year":"2002","unstructured":"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\u2013514.","journal-title":"Journal of Heuristics"},{"key":"214_CR4","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2004","unstructured":"Aickelin, U., & Dowsland, K. (2004). An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research 31, 761\u2013778.","journal-title":"Computers and Operations Research"},{"key":"214_CR5","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1023\/B:ANOR.0000019103.31340.a6","volume":"128","author":"U. Aickelin","year":"2004","unstructured":"Aickelin, U., & White, P. (2004). Building better nurse scheduling algorithms. Annals of Operations Research, 128, 159\u2013177.","journal-title":"Annals of Operations Research"},{"key":"214_CR6","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1016\/S0377-2217(03)00096-1","volume":"153","author":"F. Bellanti","year":"2004","unstructured":"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\u201340.","journal-title":"European Journal of Operational Research"},{"key":"214_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/3-540-48873-1_25","volume-title":"Simulated evolution and learning","author":"E. K. Burke","year":"1999","unstructured":"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\u2013194). Berlin: Springer."},{"key":"214_CR8","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E. K. Burke","year":"2001","unstructured":"Burke, E. K., Cowling, P., De Causmaecker, P., & Vanden Berghe, G. (2001). A memetic approach to the nurse rostering problem. Applied Intelligence, 15, 199\u2013214.","journal-title":"Applied Intelligence"},{"key":"214_CR9","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1023\/B:JOSH.0000046076.75950.0b","volume":"7","author":"E. K. Burke","year":"2004","unstructured":"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\u2013499.","journal-title":"Journal of Scheduling"},{"key":"214_CR10","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0377-2217(03)00021-3","volume":"151","author":"B. Cheang","year":"2003","unstructured":"Cheang, B., Li, H., Lim, A., & Rodrigues, B. (2003). Nurse rostering problems\u2014a bibliographic survey. European Journal of Operational Research, 151, 447\u2013460.","journal-title":"European Journal of Operational Research"},{"key":"214_CR11","first-page":"424","volume-title":"Advances in neural information processing systems","author":"J. S. Bonet De","year":"1997","unstructured":"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.\u00a0424). Cambridge: MIT Press."},{"key":"214_CR12","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1057\/palgrave.jors.2600970","volume":"51","author":"K. A. Dowsland","year":"2000","unstructured":"Dowsland, K. A., & Thompson, J. M. (2000). Solving a nurse scheduling with knapsacks, networks and tabu search. Journal of Operational Research Society, 51, 825\u2013833.","journal-title":"Journal of Operational Research Society"},{"key":"214_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0493-0","volume-title":"Introduction to graphical modelling","author":"D. Edwards","year":"2000","unstructured":"Edwards, D. (2000). Introduction to graphical modelling (2nd ed.). Berlin: Springer.","edition":"2"},{"key":"214_CR14","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"D. E. Goldberg","year":"1989","unstructured":"Goldberg, D. E. (1989). Genetic algorithms in search, optimization and machine learning. Reading: Addison-Wesley."},{"key":"214_CR15","volume-title":"Learning in graphical models","author":"D. Heckerman","year":"1998","unstructured":"Heckerman, D. (1998). A tutorial on learning with Bayesian networks. In M. Jordan (Ed.), Learning in graphical models. Cambridge: MIT Press."},{"key":"214_CR16","unstructured":"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."},{"key":"214_CR17","first-page":"24","volume":"2","author":"M. W. Isken","year":"1991","unstructured":"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\u201341.","journal-title":"Journal of the Society for Health Systems"},{"key":"214_CR18","doi-asserted-by":"crossref","unstructured":"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\u2013203).","DOI":"10.1109\/CEC.2000.870295"},{"key":"214_CR19","first-page":"169","volume":"22","author":"A. Jaszkiewicz","year":"1997","unstructured":"Jaszkiewicz, A. (1997). A metaheuristic approach to multiple objective nurse scheduling. Foundations of Computing and Decision Sciences, 22, 169\u2013184.","journal-title":"Foundations of Computing and Decision Sciences"},{"key":"214_CR20","volume-title":"Learning in graphical models","year":"1999","unstructured":"Jordan, M. I. (Ed.) (1999). Learning in graphical models. Cambridge: MIT Press."},{"key":"214_CR21","volume-title":"Estimation of distribution algorithms","author":"P. Larranaga","year":"2001","unstructured":"Larranaga, P., & Lozano, J. A. (2001). Estimation of distribution algorithms. Dordrecht: Kluwer Academic."},{"key":"214_CR22","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1162\/evco.1999.7.4.353","volume":"7","author":"H. M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein, H., & Mahnig, T. (1999). FDA\u2014a scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7, 45\u201368.","journal-title":"Evolutionary Computation"},{"key":"214_CR23","volume-title":"Probabilistic reasoning in intelligent systems: networks of plausible inference","author":"J. Pearl","year":"1998","unstructured":"Pearl, J. (1998). Probabilistic reasoning in intelligent systems: networks of plausible inference. Los Altos: Morgan Kaufmann."},{"key":"214_CR24","unstructured":"Pelikan, M., & Goldberg, D. (2000). Research on the Bayesian optimization algorithms (IlliGAL report No 200010). University of Illinois."},{"key":"214_CR25","unstructured":"Pelikan, M., Goldberg, D., & Cantu-Paz, E. (1999). BOA: the Bayesian optimization algorithm (IlliGAL report No 99003). University of Illinois."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0214-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10479-007-0214-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10479-007-0214-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T18:07:42Z","timestamp":1559153262000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10479-007-0214-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,10]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,8,22]]}},"alternative-id":["214"],"URL":"https:\/\/doi.org\/10.1007\/s10479-007-0214-0","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,10]]}}}