{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,22]],"date-time":"2025-12-22T22:09:38Z","timestamp":1766441378163},"publisher-location":"Berlin, Heidelberg","reference-count":32,"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_25","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T00:53:06Z","timestamp":1195865586000},"page":"394-412","source":"Crossref","is-referenced-by-count":45,"title":["An Experimental Study on Hyper-heuristics and Exam Timetabling"],"prefix":"10.1007","author":[{"given":"Burak","family":"Bilgin","sequence":"first","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]},{"given":"Emin Erkan","family":"Korkmaz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"25_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)"},{"key":"25_CR2","unstructured":"Ayob, M., Kendall, G.: A Monte Carlo hyper-heuristic to optimise component placement sequencing for multi head placement machine. In: InTech 2003. Proceedings of the International Conference on Intelligent Technologies, Chiang Mai, Thailand, pp. 132\u2013141 (December 2003)"},{"key":"25_CR3","series-title":"International Series in Operations Research and Management Science","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.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research and Management Science, vol.\u00a057, pp. 457\u2013474. Kluwer, Dordrecht (2003)"},{"key":"25_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1007\/3-540-61794-9_63","volume-title":"Practice and Theory of Automated Timetabling","author":"E. Burke","year":"1996","unstructured":"Burke, E., Newall, J.P., Weare, R.F.: A memetic algorithm for university exam timetabling. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol.\u00a01153, pp. 241\u2013250. Springer, Heidelberg (1996)"},{"key":"25_CR5","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 hyper-heuristic for timetabling and rostering. Journal of Heuristics\u00a09, 451\u2013470 (2003)","journal-title":"Journal of Heuristics"},{"key":"25_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1007\/3-540-61794-9_52","volume-title":"Practice and Theory of Automated Timetabling","author":"E. Burke","year":"1996","unstructured":"Burke, E., Elliman, D., Ford, P., Weare, B.: Examination timetabling in British universities \u2013 a survey. In: Burke, E.K., Ross, P. (eds.) Practice and Theory of Automated Timetabling. LNCS, vol.\u00a01153, pp. 76\u201390. Springer, Heidelberg (1996)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/B:ANOR.0000030684.30824.08","volume":"129","author":"E.K. Burke","year":"2004","unstructured":"Burke, E.K., Newall, J.P.: Solving examination timetabling problems through adaption of heuristic orderings: models and algorithms for planning and scheduling problems. Annals of Operations Research\u00a0129, 107\u2013134 (2004)","journal-title":"Annals of Operations Research"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"E.K. Burke","year":"2007","unstructured":"Burke, E.K., McCollum, B., Meisels, A., Petrovic, S., Qu, R.: A graph-based hyper heuristic for timetabling problems. European Journal of Operational Research\u00a0176, 177\u2013192 (2007)","journal-title":"European Journal of Operational Research"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"E.K. Burke","year":"2006","unstructured":"Burke, E.K., Petrovic, S., Qu, R.: Case based heuristic selection for timetabling problems. Journal of Scheduling\u00a09, 115\u2013132 (2006)","journal-title":"Journal of Scheduling"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/palgrave.jors.0470305","volume":"47","author":"M.W. Carter","year":"1996","unstructured":"Carter, M.W, Laporte, G., Lee, S.T.: Examination timetabling: algorithmic strategies and applications. Journal of the Operational Research Society\u00a047, 373\u2013383 (1996)","journal-title":"Journal of the Operational Research Society"},{"key":"25_CR11","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":"25_CR12","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":"25_CR13","unstructured":"De Jong, K.: An analysis of the behaviour of a class of genetic adaptive systems. Ph.D.\u00a0Thesis, University of Michigan (1975)"},{"key":"25_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/3-540-44629-X_7","volume-title":"Practice and Theory of Automated Timetabling III","author":"L. Gaspero Di","year":"2001","unstructured":"Di Gaspero, L., Schaerf, A.: Tabu search techniques for examination timetabling. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol.\u00a02079, pp. 104\u2013117. Springer, Heidelberg (2001)"},{"key":"25_CR15","unstructured":"Easom, E.E.: A survey of global optimization techniques. M.Eng.\u00a0Thesis, University of Louisville, KY (1990)"},{"key":"25_CR16","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"},{"key":"25_CR17","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":"25_CR18","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":"25_CR19","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":"25_CR20","first-page":"769","volume-title":"Proceedings of the 2004 IEEE International Conference on Networks","author":"G. Kendall","year":"2004","unstructured":"Kendall, G., Mohamad, M.: Channel assignment in cellular communication using a great deluge hyper-heuristic. In: Proceedings of the 2004 IEEE International Conference on Networks, pp. 769\u2013773. IEEE Computer Society Press, Los Alamitos (2004)"},{"key":"25_CR21","unstructured":"Marin, H.T.: Combinations of GAs and CSP strategies for solving examination timetabling problems. Ph.D.\u00a0Thesis, Instituto Tecnologico y de Estudios Superiores de Monterrey (1998)"},{"key":"25_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/978-3-540-45157-0_14","volume-title":"Practice and Theory of Automated Timetabling IV","author":"L.T.G. Merlot","year":"2003","unstructured":"Merlot, L.T.G., Boland, N., Hughes, B.D., Stuckey, P.J.: A hybrid algorithm for the examination timetabling problem. In: Burke, E.K., De Causmaecker, P. (eds.) PATAT 2002. LNCS, vol.\u00a02740, pp. 207\u2013231. Springer, Heidelberg (2003)"},{"key":"25_CR23","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., Michalewiz, Z. (eds.) Handbook of Evolutionary Computation, Institute of Physics Publishing, Bristol and Oxford University Press, Oxford (1997)"},{"key":"25_CR24","doi-asserted-by":"crossref","unstructured":"\u00d6zcan, E.: Towards an XML based standard for timetabling problems: TTML. In: Multidisciplinary Scheduling: Theory and Applications, vol.\u00a0163 (24), Springer, Berlin (2005)","DOI":"10.1007\/0-387-27744-7_8"},{"key":"25_CR25","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)","DOI":"10.1109\/CEC.2005.1554848"},{"key":"25_CR26","unstructured":"Paquete, L.F., Fonseca, C.M.: A study of examination timetabling with multiobjective evolutionary algorithms. In: MIC 2001. Proceedings of the 4th Metaheuristics International Conference, pp. 149\u2013154."},{"key":"25_CR27","unstructured":"Petrovic, S., Yang, Y., Dror, M.: Case-based initialisation for examination timetabling. In: MISTA 2003. Proceedings of the 1st Multidisciplinary International Conference on Scheduling: Theory and Applications, Nottingham, pp. 137\u2013154 (August 2003)"},{"key":"25_CR28","unstructured":"Rastrigin, L.A.: Extremal Control Systems. Theoretical Foundations of Engineering Cybernetics Series. Nauka, Moscow (1974)"},{"key":"25_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/11593577_4","volume-title":"Practice and Theory of Automated Timetabling V","author":"P. Rattadilok","year":"2005","unstructured":"Rattadilok, P., Gaw, A., Kwan, R.S.K.: Distributed choice function hyperheuristics for timetabling and scheduling. In: Burke, E.K., Trick, M.A. (eds.) PATAT 2004. LNCS, vol.\u00a03616, pp. 51\u201367. Springer, Heidelberg (2005)"},{"key":"25_CR30","unstructured":"Schwefel, H.P.: Numerical Optimization of Computer Models. Wiley, New York (1981) [translation of Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie (1977)]"},{"key":"25_CR31","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)"},{"key":"25_CR32","doi-asserted-by":"crossref","unstructured":"Wong, T., C\u00f4t\u00e9, P., Gely, P.: Final exam timetabling: a practical approach. In: Proceedings of the IEEE Canadian Conference on Electrical and Computer Engineering, Winnipeg, vol.\u00a02, pp. 726\u2013731 (May 2002)","DOI":"10.1109\/CCECE.2002.1013031"}],"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_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:09:00Z","timestamp":1619507340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-77345-0_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540773443"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-77345-0_25","relation":{},"subject":[]}}