{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:31:30Z","timestamp":1760707890881},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540773443"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-77345-0_6","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T05:53:06Z","timestamp":1195883586000},"page":"85-104","source":"Crossref","is-referenced-by-count":5,"title":["Memes, Self-generation and Nurse Rostering"],"prefix":"10.1007","author":[{"given":"Ender","family":"\u00d6zcan","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","first-page":"170","volume-title":"Genetic Algorithms and Simulated Annealing","author":"D. Ackley","year":"1987","unstructured":"Ackley, D.: An empirical study of bit vector function optimization. In: Davis, L. (ed.) Genetic Algorithms and Simulated Annealing, pp. 170\u2013215. Pitman, London (1987)"},{"unstructured":"Ahmad, J., Yamamoto, M., Ohuchi, A.: Evolutionary algorithms for nurse scheduling problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 196\u2013203 (2000)","key":"6_CR2"},{"key":"6_CR3","first-page":"2","volume":"4","author":"U. Aickelin","year":"2003","unstructured":"Aickelin, U., Bull, L.: On the application of hierarchical coevolutionary genetic algorithms: recombination and evaluation partners. Journal of Applied Systems Studies\u00a04, 2\u201317 (2003)","journal-title":"Journal of Applied Systems Studies"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"761","DOI":"10.1016\/S0305-0548(03)00034-0","volume":"31","author":"U. Aickelin","year":"2003","unstructured":"Aickelin, U., Dowsland, K.: An indirect genetic algorithm for a nurse scheduling problem. Computers and Operations Research\u00a031, 761\u2013778 (2003)","journal-title":"Computers and Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Alkan, A., \u00d6zcan, E.: Memetic algorithms for timetabling. In: Proceedings of the IEEE Congress on Evolutionary Computation, pp. 1796\u20131802 (2003)","key":"6_CR5","DOI":"10.1109\/CEC.2003.1299890"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0038-0121(96)00010-9","volume":"30","author":"I. Berrada","year":"1996","unstructured":"Berrada, I., Ferland, J., Michelon, P.: A multi-objective approach to nurse scheduling with both hard and soft constraints. Socio-Economic Planning Science\u00a030, 183\u2013193 (1996)","journal-title":"Socio-Economic Planning Science"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1023\/A:1011291030731","volume":"15","author":"E.K. Burke","year":"2001","unstructured":"Burke, E.K., Cowling, P.I., De Causmaecker, P., Vanden Berghe, G.: A memetic approach to the nurse rostering problem. Applied Intelligence\u00a015, 199\u2013214 (2001)","journal-title":"Applied Intelligence"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-1-4757-4137-7_7","volume-title":"Metaheuristics: Computer Decision-Making, ch. 7","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., De Causmaecker, P., Petrovic, S., Vanden Berghe, G.: Variable neighbourhood search for nurse rostering problems. In: Resende, M.G.C., de Sousa, J.P. (eds.) Metaheuristics: Computer Decision-Making, ch. 7, pp. 153\u2013172. Kluwer, Dordrecht (2003)"},{"key":"6_CR9","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","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.: A hybrid tabu search algorithm for the nurse rostering problem. In: McKay, B., Yao, X., Newton, C.S., Kim, J.-H., Furuhashi, T. (eds.) SEAL 1998. LNCS (LNAI), vol.\u00a01585, pp. 187\u2013194. Springer, Heidelberg (1999)"},{"key":"6_CR10","doi-asserted-by":"publisher","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.: The state of the art of nurse rostering. Journal of Scheduling\u00a07, 441\u2013499 (2004)","journal-title":"Journal of Scheduling"},{"key":"6_CR11","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of Metaheuristics","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Newall, J., Hart, E., Ross, P., Schulenburg, S.: Hyper-heuristics: an emerging direction in modern search technology. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"E.K. Burke","year":"2003","unstructured":"Burke, E.K., Kendall, G., Soubeiga, E.: A tabu-search hyperheuristic for timetabling and rostering. Journal of Heuristics\u00a09, 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"unstructured":"Chun, A.H.W., Chan, S.H.C., Lam, G.P.S., Tsang, F.M.F., Wong, J., Yeung, D.W.M.: Nurse rostering at the Hospital Authority of Hong Kong. In: Proceedings of the 17th National Conference on AAAI and 12th Conference on IAAI, pp. 951\u2013956 (2000)","key":"6_CR13"},{"key":"6_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/3-540-44629-X_11","volume-title":"Practice and Theory of Automated Timetabling III","author":"P. Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyper-heuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"key":"6_CR15","volume-title":"The Handbook of Genetic Algorithms","author":"L. Davis","year":"1991","unstructured":"Davis, L.: The Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)"},{"unstructured":"Davis, L.: Bit climbing, representational bias, and test suite design. In: Proceedings of the 4th International Conference on Genetic Algorithms, pp. 18\u201323 (1991)","key":"6_CR16"},{"unstructured":"De Jong, K.: An analysis of the behaviour of a class of genetic adaptive systems. Ph.D. Thesis, University of Michigan, Ann Arbor, MI (1975)","key":"6_CR17"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/S0377-2217(97)00281-6","volume":"106","author":"K. Dowsland","year":"1998","unstructured":"Dowsland, K.: Nurse scheduling with tabu search and strategic oscillation. European Journal of Operations Research\u00a0106, 393\u2013407 (1998)","journal-title":"European Journal of Operations Research"},{"unstructured":"Duenas, A., Mort, N., Reeves, C., Petrovic, D.: Handling preferences using genetic algorithms for the nurse scheduling problem. In: MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, vol.\u00a01, pp. 180\u2013196 (August 2003)","key":"6_CR19"},{"unstructured":"Easom, E.E.: A survey of global optimization techniques. M.Eng. Thesis, University of Louisville, KY (1990)","key":"6_CR20"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/0205048","volume":"5","author":"S. Even","year":"1976","unstructured":"Even, S., Itai, A., Shamir, A.: On the complexity of timetable and multicommodity flow problems. SIAM Journal of Computing\u00a05, 691\u2013703 (1976)","journal-title":"SIAM Journal of Computing"},{"unstructured":"Fang, H.L.: Genetic algorithms in timetabling and scheduling. Ph.D. Thesis, Department of Artificial Intelligence, University of Edinburgh, Scotland (1994)","key":"6_CR22"},{"unstructured":"Gendreau, M., Buzon, I., Lapierre, S., Sadr, J., Soriano, P.: A tabu search heuristic to generate shift schedules. In: MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, vol.\u00a02, pp. 526\u2013528 (August 2003)","key":"6_CR23"},{"key":"6_CR24","volume-title":"Genetic Algorithms in Search, Optimization, and Machine Learning","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading, MA (1989)"},{"key":"6_CR25","first-page":"129","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms and Walsh functions: part I, a gentle introduction. Complex Systems\u00a03, 129\u2013152 (1989)","journal-title":"Complex Systems"},{"key":"6_CR26","first-page":"153","volume":"3","author":"D.E. Goldberg","year":"1989","unstructured":"Goldberg, D.E.: Genetic algorithms and Walsh functions: part II, deception and its analysis. Complex Systems\u00a03, 153\u2013171 (1989)","journal-title":"Complex Systems"},{"key":"6_CR27","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/BF00933356","volume":"34","author":"A.O. Griewangk","year":"1981","unstructured":"Griewangk, A.O.: Generalized descent of global optimization. Journal of Optimization Theory and Applications\u00a034, 11\u201339 (1981)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"6_CR28","volume-title":"Adaptation in Natural and Artificial Systems","author":"J.H. Holland","year":"1975","unstructured":"Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, MI (1975)"},{"key":"6_CR29","first-page":"528","volume-title":"MISTA 2003","author":"L. Han","year":"2005","unstructured":"Han, L., Kendall, G.: Application of genetic algorithm based hyper-heuristic to personnel scheduling problems. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds.) MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, August 2003, pp. 528\u2013537. Springer, Berlin (2005)"},{"doi-asserted-by":"crossref","unstructured":"Kawanaka, H., Yamamoto, K., Yoshikawa, T., Shinogi, T., Tsuruoka, S.: Genetic algorithms with the constraints for nurse scheduling problem. In: Proceedings of IEEE Congress on Evolutionary Computation, CEC, Seoul, pp. 1123\u20131130 (2001)","key":"6_CR30","DOI":"10.1109\/CEC.2001.934317"},{"unstructured":"Krasnogor, N.: Studies on the theory and design space of memetic algorithms. Ph.D. Thesis, University of the West of England, Bristol, UK (2002)","key":"6_CR31"},{"unstructured":"Krasnogor, N., Smith, J.E.: Multimeme algorithms for the structure prediction and structure comparison of proteins. In: GECCO 2002. Proceedings of the Bird of a Feather Workshops, pp. 42\u201344 (2002)","key":"6_CR32"},{"unstructured":"Krasnogor, N., Smith, J.E.: Emergence of profitable search strategies based on a simple inheritance mechanism. In: GECCO 2001. Proceedings of the Genetic and Evolutionary Computation Conference, pp. 432\u2013439 (2001)","key":"6_CR33"},{"unstructured":"Krasnogor, N., Smith, J.E.: A memetic algorithm with self-adaptive local search: TSP as a case study. In: GECCO 2000. Proceedings of the Genetic and Evolutionary Computation Conference, pp. 987\u2013994 (2000)","key":"6_CR34"},{"key":"6_CR35","doi-asserted-by":"crossref","first-page":"489","DOI":"10.6028\/jres.084.024","volume":"84","author":"F.T. Leighton","year":"1979","unstructured":"Leighton, F.T.: A graph coloring algorithm for large scheduling problems. Journal of Research of the National Bureau of Standards\u00a084, 489 (1979)","journal-title":"Journal of Research of the National Bureau of Standards"},{"doi-asserted-by":"crossref","unstructured":"Li, H., Lim, A., Rodrigues, B.: A hybrid AI approach for nurse rostering problem. In: Proceedings of the 2003 ACM Symposium on Applied Computing, pp. 730\u2013735 (2003)","key":"6_CR36","DOI":"10.1145\/952532.952675"},{"key":"6_CR37","volume-title":"Handbook of Evolutionary Computation","author":"M. Mitchell","year":"1997","unstructured":"Mitchell, M., Forrest, S.: Fitness landscapes: royal road functions. In: Baeck, T., Fogel, D., Michalewicz, Z. (eds.) Handbook of Evolutionary Computation, Institute of Physics Publishing, Bristol, and Oxford University Press, Oxford (1997)"},{"key":"6_CR38","first-page":"177","volume-title":"Parallel Computing and Transputer Applications","author":"P. Moscato","year":"1992","unstructured":"Moscato, P., Norman, M.G.: A memetic approach for the traveling salesman problem implementation of a computational ecology for combinatorial optimization on message-passing systems. In: Valero, M., Onate, E., Jane, M., Larriba, J.L., Suarez, B. (eds.) Parallel Computing and Transputer Applications, pp. 177\u2013186. IOS Press, Amsterdam (1992)"},{"unstructured":"Ning, Z., Ong, Y.S., Wong, K.W., Lim, M.H.: Choice of memes in memetic algorithm. In: Proceedings of the 2nd International Conference on Computational Intelligence, Robotics and Autonomous Systems (2003)","key":"6_CR39"},{"key":"6_CR40","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"Y.S. Ong","year":"2004","unstructured":"Ong, Y.S., Keane, A.J.: Meta-Lamarckian learning in memetic algorithms. IEEE Transactions on Evolutionary Computation\u00a08, 99\u2013110 (2004)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"6_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/11569596_51","volume-title":"Computer and Information Sciences - ISCIS 2005","author":"E. \u00d6zcan","year":"2005","unstructured":"\u00d6zcan, E.: Memetic Algorithms for Nurse Rostering. In: Yolum, p., G\u00fcng\u00f6r, T., G\u00fcrgen, F., \u00d6zturan, C. (eds.) ISCIS 2005. LNCS, vol.\u00a03733, pp. 482\u2013492. Springer, Heidelberg (2005)"},{"key":"6_CR42","first-page":"163","volume-title":"MISTA 2003","author":"E. \u00d6zcan","year":"2005","unstructured":"\u00d6zcan, E.: Towards an XML based standard for timetabling problems: TTML. In: Kendall, G., Burke, E.K., Petrovic, S., Gendreau, M. (eds.) MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, p. 163. Springer, Berlin (August 2005)"},{"key":"6_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1007\/11844297_21","volume-title":"Parallel Problem Solving from Nature - PPSN IX","author":"E. \u00d6zcan","year":"2006","unstructured":"\u00d6zcan, E., Bilgin, B., Korkmaz, E.E.: Hill climbers and mutational heuristics in hyperheuristics. In: Runarsson, T.P., Beyer, H.-G., Burke, E., Merelo-Guerv\u00f3s, J.J., Whitley, L.D., Yao, X. (eds.) Parallel Problem Solving from Nature - PPSN IX. LNCS, vol.\u00a04193, pp. 202\u2013211. Springer, Heidelberg (2006)"},{"doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E., Ersoy, E.: Final exam scheduler \u2013 FES. In: Proceedings of the 2005 IEEE Congress on Evolutionary Computation, vol.\u00a02, pp. 1356\u20131363 (2005)","key":"6_CR44","DOI":"10.1109\/CEC.2005.1554848"},{"key":"6_CR45","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10766-006-0026-x","volume":"35","author":"E. \u00d6zcan","year":"2007","unstructured":"\u00d6zcan, E., Onbasioglu, E.: Memetic algorithms for parallel code optimization. International Journal of Parallel Programming\u00a035, 33\u201361 (2007)","journal-title":"International Journal of Parallel Programming"},{"key":"6_CR46","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Evolutionary Computing","author":"N.J. Radcliffe","year":"1994","unstructured":"Radcliffe, N.J., Surry, P.D.: Formal memetic algorithms. In: Fogarty, T.C. (ed.) Evolutionary Computing. LNCS, vol.\u00a0865, pp. 1\u201316. Springer, Heidelberg (1994)"},{"unstructured":"Rastrigin, L.A.: Extremal Control Systems, Theoretical Foundations of Engineering Cybernetics Series, Nauka, Moscow (1974)","key":"6_CR47"},{"key":"6_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"556","DOI":"10.1007\/3-540-58484-6_298","volume-title":"Parallel Problem Solving from Nature - PPSN III","author":"P. Ross","year":"1994","unstructured":"Ross, P., Corne, D., Fang, H.-L.: Improving evolutionary timetabling with delta evaluation and directed mutation. In: Davidor, Y., M\u00e4nner, R., Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN III. LNCS, vol.\u00a0866, pp. 556\u2013565. Springer, Heidelberg (1994)"},{"doi-asserted-by":"crossref","unstructured":"Ross, P., Corne, D., Fang, H.-L.: Fast practical evolutionary timetabling. In: Proceedings of the AISB Workshop on Evolutionary Computation, pp. 250\u2013263 (1994)","key":"6_CR49","DOI":"10.1007\/3-540-58483-8_19"},{"key":"6_CR50","volume-title":"Numerical Optimization of Computer Models","author":"H.-P. Schwefel","year":"1981","unstructured":"Schwefel, H.-P.: Numerical Optimization of Computer Models. Wiley, Chichester (1981)"},{"key":"6_CR51","volume-title":"Evolution and Optimum Seeking","author":"H.-P. Schwefel","year":"1995","unstructured":"Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)"},{"key":"6_CR52","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s005000050009","volume":"1","author":"J. Smith","year":"1997","unstructured":"Smith, J., Fogarty, T.C.: Operator and parameter adaptation in genetic algorithms. Soft Computing\u00a01, 81\u201387 (1997)","journal-title":"Soft Computing"},{"key":"6_CR53","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1109\/CEC.2004.1331145","volume-title":"Proceedings of the 2004 IEEE Congress on Evolutionary Computation","author":"D. Tasoulis","year":"2004","unstructured":"Tasoulis, D., Pavlidis, N., Plagianakos, V., Vrahatis, M.: Parallel differential evolution. In: Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 2023\u20132029. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"6_CR54","volume-title":"Foundations of Genetic Algorithms","author":"D. Whitley","year":"1991","unstructured":"Whitley, D.: Fundamental principles of deception in genetic search. In: Rawlins, G.J.E. (ed.) Foundations of Genetic Algorithms, Morgan Kaufmann, San Mateo, CA (1991)"}],"container-title":["Lecture Notes in Computer Science","Practice and Theory of Automated Timetabling VI"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-77345-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:09:01Z","timestamp":1619521741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_6","relation":{},"subject":[]}}