{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T15:34:53Z","timestamp":1743089693328,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031234910"},{"type":"electronic","value":"9783031234927"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-23492-7_19","type":"book-chapter","created":{"date-parts":[[2023,1,23]],"date-time":"2023-01-23T10:03:37Z","timestamp":1674468217000},"page":"219-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Automated Design of\u00a0Dynamic Heuristic Set Selection for\u00a0Cross-Domain Selection Hyper-Heuristics"],"prefix":"10.1007","author":[{"given":"Ahmed","family":"Hassan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nelishia","family":"Pillay","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,24]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Adriaensen, S., Brys, T., Now\u00e9, A.: Fair-share ILS: a simple state-of-the-art iterated local search hyperheuristic. In: Proceedings of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 1303\u20131310 (2014)","DOI":"10.1145\/2576768.2598285"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/978-3-642-34413-8_26","volume-title":"Learning and Intelligent Optimization","author":"CY Chan","year":"2012","unstructured":"Chan, C.Y., Xue, F., Ip, W.H., Cheung, C.F.: A hyper-heuristic inspired by pearl hunting. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 349\u2013353. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_26"},{"issue":"2","key":"19_CR3","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2019.07.073","volume":"285","author":"JH Drake","year":"2020","unstructured":"Drake, J.H., Kheiri, A., \u00d6zcan, E., Burke, E.K.: Recent advances in selection hyper-heuristics. Eur. J. Oper. Res. 285(2), 405\u2013428 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/978-3-642-25566-3_49","volume-title":"Learning and Intelligent Optimization","author":"EK Burke","year":"2011","unstructured":"Burke, E.K., et al.: The cross-domain heuristic search challenge \u2013 an international research competition. In: Coello, C.A.C. (ed.) LION 2011. LNCS, vol. 6683, pp. 631\u2013634. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_49"},{"issue":"12","key":"19_CR5","doi-asserted-by":"publisher","first-page":"1695","DOI":"10.1057\/jors.2013.71","volume":"64","author":"EK Burke","year":"2013","unstructured":"Burke, E.K., et al.: Hyper-heuristics: a survey of the state of the art. J. Oper. Res. Soc. 64(12), 1695\u20131724 (2013)","journal-title":"J. Oper. Res. Soc."},{"issue":"3","key":"19_CR6","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/TEVC.2011.2160401","volume":"16","author":"EK Burke","year":"2012","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G.: Grammatical evolution of local search heuristics. IEEE Trans. Evol. Comput. 16(3), 406\u2013417 (2012)","journal-title":"IEEE Trans. Evol. Comput."},{"issue":"15","key":"19_CR7","doi-asserted-by":"publisher","first-page":"6876","DOI":"10.1016\/j.eswa.2014.04.043","volume":"41","author":"E L\u00f3pez-Camacho","year":"2014","unstructured":"L\u00f3pez-Camacho, E., Terashima-Marin, H., Ross, P., Ochoa, G.: A unified hyper-heuristic framework for solving bin packing problems. Expert Syst. Appl. 41(15), 6876\u20136889 (2014)","journal-title":"Expert Syst. Appl."},{"key":"19_CR8","doi-asserted-by":"crossref","unstructured":"Gutierrez-Rodr\u00edguez, A.E., et al.: Applying automatic heuristic-filtering to improve hyper-heuristic performance. In: 2017 IEEE Congress on Evolutionary Computation (CEC), pp. 2638\u20132644. IEEE (2017)","DOI":"10.1109\/CEC.2017.7969626"},{"key":"19_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-030-90425-8_3","volume-title":"Theory and Practice of Natural Computing","author":"A Hassan","year":"2021","unstructured":"Hassan, A., Pillay, N.: Dynamic heuristic set selection for cross-domain selection hyper-heuristics. In: Aranha, C., Mart\u00edn-Vide, C., Vega-Rodr\u00edguez, M.A. (eds.) TPNC 2021. LNCS, vol. 13082, pp. 33\u201344. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-90425-8_3"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Hsiao, P.C., Chiang, T.C., Fu, L.C.: A VNS-based hyper-heuristic with adaptive computational budget of local search. In: 2012 IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2012)","DOI":"10.1109\/CEC.2012.6252969"},{"issue":"1","key":"19_CR11","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.asoc.2009.05.003","volume":"10","author":"J Hugosson","year":"2010","unstructured":"Hugosson, J., Hemberg, E., Brabazon, A., O\u2019Neill, M.: Genotype representations in grammatical evolution. Appl. Soft Comput. 10(1), 36\u201343 (2010)","journal-title":"Appl. Soft Comput."},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1016\/j.ins.2014.02.155","volume":"277","author":"G Koulinas","year":"2014","unstructured":"Koulinas, G., Kotsikas, L., Anagnostopoulos, K.: A particle swarm optimization based hyper-heuristic algorithm for the classic resource constrained project scheduling problem. Inf. Sci. 277, 680\u2013693 (2014)","journal-title":"Inf. Sci."},{"key":"19_CR13","unstructured":"Meignan, D.: An evolutionary programming hyper-heuristic with co-evolution for CHeSC11. In: The 53rd Annual Conference of the UK Operational Research Society (OR53), vol. 3 (2011)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-32964-7_41","volume-title":"Parallel Problem Solving from Nature - PPSN XII","author":"M M\u0131s\u0131r","year":"2012","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: The effect of the set of low-level heuristics on the performance of selection hyper-heuristics. In: Coello, C.A.C., Cutello, V., Deb, K., Forrest, S., Nicosia, G., Pavone, M. (eds.) PPSN 2012. LNCS, vol. 7492, pp. 408\u2013417. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32964-7_41"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-642-34413-8_45","volume-title":"Learning and Intelligent Optimization","author":"M M\u0131s\u0131r","year":"2012","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: An intelligent hyper-heuristic framework for CHeSC 2011. In: Hamadi, Y., Schoenauer, M. (eds.) LION 2012. LNCS, pp. 461\u2013466. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_45"},{"issue":"6","key":"19_CR16","doi-asserted-by":"publisher","first-page":"840","DOI":"10.1109\/TEVC.2013.2281527","volume":"17","author":"NR Sabar","year":"2013","unstructured":"Sabar, N.R., Ayob, M., Kendall, G., Qu, R.: Grammatical evolution hyper-heuristic for combinatorial optimization problems. IEEE Trans. Evol. Comput. 17(6), 840\u2013861 (2013)","journal-title":"IEEE Trans. Evol. Comput."},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.eswa.2018.03.030","volume":"104","author":"T Nyathi","year":"2018","unstructured":"Nyathi, T., Pillay, N.: Comparison of a genetic algorithm to grammatical evolution for automated design of genetic programming classification algorithms. Expert Syst. Appl. 104, 213\u2013234 (2018)","journal-title":"Expert Syst. Appl."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-642-29124-1_12","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"G Ochoa","year":"2012","unstructured":"Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol. 7245, pp. 136\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29124-1_12"},{"key":"19_CR19","unstructured":"Pillay, N.: Evolving hyper-heuristics for a highly constrained examination timetabling problem. In: Proceedings of the 8th International Conference on the Practice and Theory of Automated Timetabling (PATAT 2010), pp. 336\u2013346 (2010)"},{"issue":"1","key":"19_CR20","first-page":"31","volume":"48","author":"N Pillay","year":"2012","unstructured":"Pillay, N.: A study of evolutionary algorithm selection hyper-heuristics for the one-dimensional bin-packing problem. S. Afr. Comput. J. 48(1), 31\u201340 (2012)","journal-title":"S. Afr. Comput. J."},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10479-014-1688-1","volume":"239","author":"N Pillay","year":"2016","unstructured":"Pillay, N.: A review of hyper-heuristics for educational timetabling. Ann. Oper. Res. 239(1), 3\u201338 (2016)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"19_CR22","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10479-017-2625-x","volume":"275","author":"N Pillay","year":"2019","unstructured":"Pillay, N., \u00d6zcan, E.: Automated generation of constructive ordering heuristics for educational timetabling. Ann. Oper. Res. 275(1), 181\u2013208 (2019)","journal-title":"Ann. Oper. Res."},{"issue":"3\u20134","key":"19_CR23","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10710-010-9109-y","volume":"11","author":"RI McKay","year":"2010","unstructured":"McKay, R.I., Hoai, N.X., Whigham, P.A., Shan, Y., O\u2019neill, M.: Grammar-based genetic programming: a survey. Genet. Program. Evolvable Mach. 11(3\u20134), 365\u2013396 (2010)","journal-title":"Genet. Program. Evolvable Mach."},{"key":"19_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-71615-0_17","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"S Remde","year":"2007","unstructured":"Remde, S., Cowling, P., Dahal, K., Colledge, N.: Exact\/heuristic hybrids using rVNS and hyperheuristics for workforce scheduling. In: Cotta, C., van Hemert, J. (eds.) EvoCOP 2007. LNCS, vol. 4446, pp. 188\u2013197. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-71615-0_17"},{"issue":"3","key":"19_CR25","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1016\/j.ejor.2017.01.042","volume":"260","author":"JA Soria-Alcaraz","year":"2017","unstructured":"Soria-Alcaraz, J.A., Ochoa, G., Sotelo-Figeroa, M.A., Burke, E.K.: A methodology for determining an effective subset of heuristics in selection hyper-heuristics. Eur. J. Oper. Res. 260(3), 972\u2013983 (2017)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence and Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-23492-7_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,12]],"date-time":"2024-10-12T19:48:28Z","timestamp":1728762508000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-23492-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031234910","9783031234927"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-23492-7_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"24 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICAISC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence and Soft Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Zakopane","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Poland","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 June 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icaisc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icaisc.eu\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}