{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:59:17Z","timestamp":1780055957651,"version":"3.54.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2009,10,11]],"date-time":"2009-10-11T00:00:00Z","timestamp":1255219200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Memetic Comp."],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1007\/s12293-009-0022-y","type":"journal-article","created":{"date-parts":[[2009,10,10]],"date-time":"2009-10-10T07:18:50Z","timestamp":1255159130000},"page":"205-219","source":"Crossref","is-referenced-by-count":48,"title":["Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework"],"prefix":"10.1007","volume":"1","author":[{"given":"Mohamed","family":"Bader-El-Den","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Riccardo","family":"Poli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaheen","family":"Fatima","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2009,10,11]]},"reference":[{"key":"22_CR1","doi-asserted-by":"crossref","unstructured":"Abbass HA (2001) MBO: marriage in honey bees optimization\u2014a haplometrosis polygynous swarming approach. In: Proceedings of the 2001 IEEE congress on evolutionary computation. IEEE Press, Seoul, Korea, pp 207\u2013214","DOI":"10.1109\/CEC.2001.934391"},{"issue":"2","key":"22_CR2","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s00291-006-0034-7","volume":"29","author":"S Abdullah","year":"2007","unstructured":"Abdullah S, Ahmadi S, Burke EK, Dror M (2007) Investigating ahuja-borlins large neighbourhood search approach for examination timetabling. OR Spectr 29(2): 351\u2013372","journal-title":"OR Spectr"},{"key":"22_CR3","unstructured":"Ahmadi S, Barrone R, Chen P, Cowling PI, McCollum B (2003) Perturbation based variable neighbourhood search in heuristic space for examination timetabling problem. In: Selected papers from MISTA 2003, pp 155\u2013171"},{"key":"22_CR4","unstructured":"Asmuni H, Burke EK, Garibaldi JM, McCollum B (2004) Fuzzy multiple heuristic orderings for examination timetabling. In: PATAT\u201904: The 4th international conference for the practice and pheory of automated timetabling, pp 334\u2013353"},{"key":"22_CR5","doi-asserted-by":"crossref","unstructured":"Bader-El-Den MB, Poli R (2007) Generating sat local-search heuristics using a gp hyper-heuristic framework. In: Monmarch\u00e9 N et\u00a0al (eds) Artificial evolution, vol 4926, pp 37\u201349","DOI":"10.1007\/978-3-540-79305-2_4"},{"key":"22_CR6","unstructured":"Bilgin B, \u00d6zcan E, Korkmaz EE (2006) An experimental study on hyper-heuristics and exam timetabling. In: PATAT\u201906: The 6th international conference for the practice and theory of automated timetabling, pp 394\u2013412"},{"issue":"4","key":"22_CR7","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz D (1979) New methods to color the vertices of a graph. Commun ACM 22(4): 251\u2013256","journal-title":"Commun ACM"},{"issue":"8","key":"22_CR8","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1145\/355586.364824","volume":"7","author":"S Broder","year":"1964","unstructured":"Broder S (1964) Final examination scheduling. Commun ACM 7(8): 494\u2013498","journal-title":"Commun ACM"},{"issue":"6","key":"22_CR9","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1080\/07408170490438410","volume":"36","author":"EK Burke","year":"2004","unstructured":"Burke EK, Bykov Y, Newall J, Petrovic S (2004) A time-predefined local search approach to exam timetabling problems. IIE Trans 36(6): 509\u2013528","journal-title":"IIE Trans"},{"key":"22_CR10","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/0-387-23529-9_6","volume-title":"The next wave in computing, optimization, and decision technologies","author":"EK Burke","year":"2005","unstructured":"Burke EK, Dror M, Petrovic S, Qu R (2005) Hybrid graph heuristics in hyper-heuristics applied to exam timetabling problems. In: Golden BL et\u00a0al (eds) The next wave in computing, optimization, and decision technologies. Springer, Maryland, pp 79\u201391"},{"key":"22_CR11","doi-asserted-by":"crossref","first-page":"860","DOI":"10.1007\/11844297_87","volume-title":"Parallel problem solving from nature\u2014PPSN IX, LNCS, vol 4193","author":"EK Burke","year":"2006","unstructured":"Burke EK, Hyde MR, Kendall G (2006) Evolving bin packing heuristics with genetic programming. In: Runarsson et\u00a0al (eds) Parallel problem solving from nature\u2014PPSN IX, LNCS, vol 4193. Springer, Reykjavik, pp 860\u2013869"},{"key":"22_CR12","doi-asserted-by":"crossref","unstructured":"Burke EK, Hyde MR, Kendall G, Woodward J (2007) Automatic heuristic generation with genetic programming: evolving a jack-of-all-trades or a master of one. In: GECCO \u201907: Proceedings of the 9th annual conference on genetic and evolutionary computation. ACM, New York, pp 1559\u20131565","DOI":"10.1145\/1276958.1277273"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"Burke EK, Kendall G, Silva DL, O\u2019Brien R, Soubeiga E (2005) An ant algorithm hyperheuristic for the project presentation scheduling problem. In: 2005 IEEE congress on evolutionary computation. IEEE press, pp 2263\u20132270","DOI":"10.1109\/CEC.2005.1554976"},{"issue":"6","key":"22_CR14","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1023\/B:HEUR.0000012446.94732.b6","volume":"9","author":"EK Burke","year":"2003","unstructured":"Burke EK, Kendall G, Soubeiga E (2003) A tabu-search hyperheuristic for timetabling and rostering. J Heuristics 9(6): 451\u2013470","journal-title":"J Heuristics"},{"issue":"1","key":"22_CR15","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/j.ejor.2005.08.012","volume":"176","author":"EK Burke","year":"2007","unstructured":"Burke EK, McCollum B, Meisels A, Petrovic S, Qu R (2007) A graph-based hyper-heuristic for educational timetabling problems. Eur J Oper Res 176(1): 177\u2013192","journal-title":"Eur J Oper Res"},{"key":"22_CR16","unstructured":"Burke EK, Newall JP (2002) Enhancing timetable solutions with local search methods. In: PATAT\u201902: The 3rd international conference for the practice and theory of automated timetabling, pp 195\u2013206"},{"issue":"2","key":"22_CR17","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10951-006-6775-y","volume":"9","author":"EK Burke","year":"2006","unstructured":"Burke EK, Petrovic S, Qu R (2006) Case-based heuristic selection for timetabling problems. J Sched 9(2): 115\u2013132","journal-title":"J Sched"},{"key":"22_CR18","doi-asserted-by":"crossref","first-page":"457","DOI":"10.1007\/0-306-48056-5_16","volume-title":"Handbook of metaheuristics","author":"KE Burke","year":"2003","unstructured":"Burke KE, Kendall G, Newall J, Hart E, Ross P, Schulenburg S (2003) Hyper-heuristics: an emerging direction in modern search technology. In: Glover et\u00a0al (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 457\u2013474"},{"key":"22_CR19","doi-asserted-by":"crossref","unstructured":"Caramia M, Dell\u2019Olmo P, Italiano GF (2001) New algorithms for examination timetabling. In: WAE \u201900: Proceedings of the 4th International workshop on algorithm engineering. Springer, London, pp 230\u2013242","DOI":"10.1007\/3-540-44691-5_20"},{"key":"22_CR20","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1057\/jors.1996.37","volume":"47","author":"MW Carter","year":"1996","unstructured":"Carter MW, Laporte G, Lee SY (1996) Examination timetabling: algorithmic strategies and. J Oper Res Soc 47: 73\u201383","journal-title":"J Oper Res Soc"},{"key":"22_CR21","unstructured":"Casey S, Thompson J (2002) Grasping the examination scheduling problem. In: PATAT\u201902: The 4th international conference for the practice and theory of automated timetabling, pp 232\u2013246"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Corne D, Ross P, lan Fang H (1994) Evolutionary timetabling: practice, prospects and work in progress. In: Proceedings of the UK planning and scheduling SIG workshop","DOI":"10.1007\/3-540-58483-8_19"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Corr PH, McCollum B, McGreevy MAJ, McMullan PJP (2006) A new neural network based construction heuristic for the examination timetabling problem. In: Procedings of 9th international conference parallel problem solving from nature\u2014PPSN IX, pp 392\u2013401","DOI":"10.1007\/11844297_40"},{"key":"22_CR24","unstructured":"C\u00f4t\u00e9 P, Wong T, Sabourin R (2004) A hybrid multi-objective evolutionary algorithm for the uncapacitated exam proximity problem. In: PATAT\u201904: The 4th international conference for the practice and theory of automated timetabling, pp 294\u2013312"},{"key":"22_CR25","doi-asserted-by":"crossref","unstructured":"Cowling PI, Kendall G, Han L (2002) An investigation of a hyperheuristic genetic algorithm applied to a trainer scheduling problem. In: Proceedings of the 2002 IEEE congress on evolutionary computation. IEEE press, Washington, DC, pp 1185\u20131190","DOI":"10.1109\/CEC.2002.1004411"},{"issue":"8","key":"22_CR26","doi-asserted-by":"crossref","first-page":"733","DOI":"10.1002\/spe.524","volume":"33","author":"L Di Gaspero","year":"2003","unstructured":"Di Gaspero L, Schaerf A (2003) Easylocal++: an object-oriented framework for the flexible design of local-search algorithms. Softw Pract Exp 33(8): 733\u2013765","journal-title":"Softw Pract Exp"},{"key":"22_CR27","doi-asserted-by":"crossref","unstructured":"Du J, Korkmaz E, Alhajj R, Barker K (2004) Novel clustering approach that employs genetic algorithm with new representation scheme and multiple objectives. In: DaWaK\u201904: Proceedings of the 6th international conference on data warehousing and knowledge discovery, vol 3181\/2004. Springer, Heidelberg","DOI":"10.1007\/978-3-540-30076-2_22"},{"key":"22_CR28","doi-asserted-by":"crossref","unstructured":"Erben W (2001) A grouping genetic algorithm for graph colouring and exam timetabling. In: PATAT \u201900: The 3rd international conference for the practice and theory of automated timetabling. Springer, London, pp 132\u2013158","DOI":"10.1007\/3-540-44629-X_9"},{"key":"22_CR29","unstructured":"Ersoy E, Ozcan E, Etaner-Uyar AS (2007) Memetic algorithms and hyperhill-climbers. In: Baptiste J et\u00a0al (eds) MISTA\u201907: The 3rd multidisciplinary international scheduling conference: theory and applications, pp 159\u2013166"},{"key":"22_CR30","unstructured":"Fukunaga AS (2002) Automated discovery of composite sat variable-selection heuristics. In: Proceedings of the18th national conference on artificial intelligence. AAAI, pp 641\u2013648"},{"key":"22_CR31","unstructured":"Gaspero LD, Schaerf A (2000) Tabu search techniques for examination timetabling. In: PATAT\u201906: The 3rd international conference for the practice and theory of automated timetabling, pp 104\u2013117"},{"issue":"1","key":"22_CR32","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1007\/s12293-008-0001-8","volume":"1","author":"G Gutin","year":"2009","unstructured":"Gutin G, Karapetyan D (2009) A selection of useful theoretical tools for the design and analysis of optimization heuristics. Memet Comput 1(1): 25\u201334","journal-title":"Memet Comput"},{"key":"22_CR33","volume-title":"Selected papers from MISTA 2003","author":"G Kendall","year":"2004","unstructured":"Kendall G, Hussin NM (2004) An investigation of a tabu search based hyper-heuristic for examination timetabling. In: Kendall G, Burke EK, Petrovic S (eds) Selected papers from MISTA 2003. Kluwer, Dordrecht"},{"key":"22_CR34","volume-title":"Genetic programming: on the programming of computers by means of natural selection","author":"JR Koza","year":"1992","unstructured":"Koza JR (1992) Genetic programming: on the programming of computers by means of natural selection. MIT Press, Cambridge"},{"key":"22_CR35","unstructured":"Krasnogor N (2002) Studies on the theory and design space of memetic algorithms. Ph.D. thesis, University of the West of England"},{"issue":"1","key":"22_CR36","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:NACO.0000023419.83147.67","volume":"3","author":"N Krasnogor","year":"2004","unstructured":"Krasnogor N, Gustafson S (2004) A study on the use of \u201cself- generation\u201d in memetic algorithms. Nat Comput 3(1): 53\u201376","journal-title":"Nat Comput"},{"key":"22_CR37","unstructured":"Merlot LTG, Boland N, Hughes BD, Stuckey PJ (2002) A hybrid algorithm for the examination timetabling problem. In: PATAT\u201902: The 3rd international conference for the practice and theory of automated timetabling, pp 207\u2013231"},{"issue":"2","key":"22_CR38","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1162\/evco.1995.3.2.199","volume":"3","author":"DJ Montana","year":"1995","unstructured":"Montana DJ (1995) Strongly typed genetic programming. Evol Comput 3(2): 199\u2013230","journal-title":"Evol Comput"},{"key":"22_CR39","unstructured":"Moscato P (1989) On evolution, search, optimization, genetic algorithms and martial arts: towards memetic algorithms. Technical Report 826, Caltech concurrent computation program"},{"key":"22_CR40","doi-asserted-by":"crossref","unstructured":"Nguyen QH, Ong YS, Lim MH (2008) Non-genetic transmission of memes by diffusion. In: GECCO\u201908: Proceedings of the 10th annual conference on Genetic and evolutionary computation. ACM, New York, pp 1017\u20131024","DOI":"10.1145\/1389095.1389285"},{"issue":"2","key":"22_CR41","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1109\/TEVC.2003.819944","volume":"8","author":"YS Ong","year":"2004","unstructured":"Ong YS, Kean AJ (2004) Meta-lamarckian learning in memetic algorithms. IEEE Trans Evol Comput 8(2): 99\u2013110","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"22_CR42","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N, Wong KW (2006) Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"3","key":"22_CR43","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/s10115-008-0171-1","volume":"19","author":"G Pappa","year":"2009","unstructured":"Pappa G, Freitas A (2009) Evolving rule induction algorithms with multi-objective grammar-based genetic programming. Knowl Inf Syst 19(3): 283\u2013309","journal-title":"Knowl Inf Syst"},{"key":"22_CR44","doi-asserted-by":"crossref","unstructured":"Poli R, Graff M (2009) There is a free lunch for hyper-heuristics, genetic programming and computer scientists. In: Vanneschi L et\u00a0al (eds) EuroGP\u201909: Proceedings of the 12th european conference on genetic programming, vol 5481. Springer, pp 195\u2013207","DOI":"10.1007\/978-3-642-01181-8_17"},{"key":"22_CR45","unstructured":"Poli R, Langdon WB, McPhee NF (2008) A field guide to genetic programming. Published via http:\/\/lulu.com and freely available at http:\/\/www.gp-field-guide.org.uk"},{"key":"22_CR46","doi-asserted-by":"crossref","unstructured":"Poli R, Woodward J, Burke EK (2007) A histogram-matching approach to the evolution of bin-packing strategies. In: 2007 IEEE congress on evolutionary computation. IEEE Press, Singapore, pp 3500\u20133507","DOI":"10.1109\/CEC.2007.4424926"},{"key":"22_CR47","doi-asserted-by":"crossref","unstructured":"Ross P, Corne D, Terashima-Mar\u00edn H (1996) The phase-transition niche for evolutionary algorithms in timetabling. In: PATAT\u201995: The 1st international conference for the practice and theory of automated timetabling. Springer, London, pp 309\u2013324","DOI":"10.1007\/3-540-61794-9_68"},{"key":"22_CR48","doi-asserted-by":"crossref","unstructured":"Ross P, Hart E, Corne D (1998) Some observations about ga-based exam timetabling. In: PATAT\u201997: The 2nd international conference for the practice and theory of automated timetabling. Springer, London, pp 115\u2013129","DOI":"10.1007\/BFb0055884"},{"key":"22_CR49","first-page":"755","volume-title":"Genetic algorithms and timetabling","author":"P Ross","year":"2003","unstructured":"Ross P, Hart E, Corne D (2003) Genetic algorithms and timetabling. Springer, New York, pp 755\u2013771"},{"key":"22_CR50","first-page":"565","volume-title":"GECCO\u201901: Proceedings of the 3rd genetic and evolutionary computation conference","author":"C Schumacher","year":"2001","unstructured":"Schumacher C, Vose MD, Whitley LD (2001) The no free lunch and problem description length. In: Spector L et\u00a0al (eds) GECCO\u201901: Proceedings of the 3rd genetic and evolutionary computation conference. Morgan Kaufmann, CA, USA, pp 565\u2013570"},{"issue":"1","key":"22_CR51","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TSMCB.2006.883273","volume":"37","author":"JE Smith","year":"2007","unstructured":"Smith JE (2007) Coevolving memetic algorithms: a review and progress report. IEEE Trans Syst Man Cybern B 37(1): 6\u201317","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"22_CR52","first-page":"635","volume-title":"Proceedings of the genetic and evolutionary computation conference, vol 1","author":"H Terashima-Marin","year":"1999","unstructured":"Terashima-Marin H, Ross P, Valenzuela-Rendon M (1999) Evolution of constraint satisfaction strategies in examination timetabling. In: Banzhaf W et\u00a0al (eds) Proceedings of the genetic and evolutionary computation conference, vol 1. Morgan Kaufmann, Florida, pp 635\u2013642"},{"key":"22_CR53","unstructured":"\u00dclker \u00d6, \u00d6zcan E, Korkmaz EE (2006) Linear linkage encoding in grouping problems: applications on graph coloring and timetabling. In: Burke EK, Rudov\u00e1 H (eds) PATAT\u201906: The 5th international conference for the practice and theory of automated timetabling, Lecture Notes in Computer Science, vol 3867. Springer, pp 347\u2013363"},{"key":"22_CR54","doi-asserted-by":"crossref","unstructured":"Voudouris C, Dorne R, Lesaint D, Liret A (2001) iopt: a software toolkit for heuristic search methods. In: Walsh T (ed) Proceedings of the 7th international conference on principles and practice of constraint programming, vol 2239. Springer, pp 716\u2013719","DOI":"10.1007\/3-540-45578-7_58"},{"issue":"1","key":"22_CR55","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1093\/comjnl\/10.1.85","volume":"10","author":"D Welsh","year":"1967","unstructured":"Welsh D, Powell M (1967) An upper bound for the chromatic number of a graph and its application to timetabling problems. Comput J 10(1): 85\u201387","journal-title":"Comput J"},{"key":"22_CR56","unstructured":"Whigham PA (1995) Grammatically-based genetic programming. In: Rosca JP (ed) Proceedings of the workshop on genetic programming: from theory to real-world applications. Tahoe City, CA, pp 33\u201341"},{"key":"22_CR57","unstructured":"Whigham PA (1997) Evolving a program defined by a formal grammar. In: The 4th international conference on neural information processing\u2014The annual conference of the Asian Pacific neural network assembly (ICONIP\u201997). Dunedin, New Zealand"},{"issue":"1","key":"22_CR58","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert DH, Macready WG (1997) No free lunch theorems for optimization. IEEE Trans Evol Comput 1(1): 67\u201382","journal-title":"IEEE Trans Evol Comput"},{"issue":"3","key":"22_CR59","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/0305-0548(74)90064-1","volume":"1","author":"M Zeleny","year":"1974","unstructured":"Zeleny M (1974) A concept of compromise solutions and the method of the displaced ideal. Comput Oper Res 1(3): 479\u2013496","journal-title":"Comput Oper Res"}],"container-title":["Memetic Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0022-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s12293-009-0022-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s12293-009-0022-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T03:45:52Z","timestamp":1559447152000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s12293-009-0022-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,11]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2009,11]]}},"alternative-id":["22"],"URL":"https:\/\/doi.org\/10.1007\/s12293-009-0022-y","relation":{},"ISSN":["1865-9284","1865-9292"],"issn-type":[{"value":"1865-9284","type":"print"},{"value":"1865-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,11]]}}}