{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T15:20:09Z","timestamp":1773415209618,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,11,14]],"date-time":"2012-11-14T00:00:00Z","timestamp":1352851200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2013,6]]},"DOI":"10.1007\/s10951-012-0295-8","type":"journal-article","created":{"date-parts":[[2012,11,13]],"date-time":"2012-11-13T20:22:33Z","timestamp":1352838153000},"page":"291-311","source":"Crossref","is-referenced-by-count":25,"title":["A new hyper-heuristic as a general problem solver: an implementation in HyFlex"],"prefix":"10.1007","volume":"16","author":[{"given":"Mustafa","family":"M\u0131s\u0131r","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katja","family":"Verbeeck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Patrick De","family":"Causmaecker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Greet Vanden","family":"Berghe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,11,14]]},"reference":[{"key":"295_CR1","volume-title":"Introduction to machine learning","author":"E Alpaydin","year":"2010","unstructured":"Alpaydin, E. (2010). Introduction to machine learning (2nd ed.). Cambridge, MA: MIT Press.","edition":"2"},{"key":"295_CR2","doi-asserted-by":"crossref","unstructured":"Bader-El-Den, M., Poli, R.,& Fatima, S. (2009). Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework. Memetic Computing, 1(3), 205\u2013 219.","DOI":"10.1007\/s12293-009-0022-y"},{"key":"295_CR3","doi-asserted-by":"crossref","unstructured":"Bilgin, B., Demeester, P., M\u0131s\u0131r, M.,& Vancroonenburg, W. (2012). One hyperheuristic approach to two timetabling problems in health care. Journal of Heuristics, 18(3), 401\u2013434.","DOI":"10.1007\/s10732-011-9192-0"},{"key":"295_CR4","unstructured":"Bilgin, B., Demeester, P., M\u0131s\u0131r, M., Vancroonenburg, W., Vanden Berghe, G.,& Wauters, T. (2010). A hyper-heuristic combined with a greedy shuffle approach to the nurse rostering competition. In The 8th international conference on the practice and theory of automated timetabling (PATAT\u201910)\u2014the nurse rostering competition, Belfast."},{"key":"295_CR5","unstructured":"Bowling, M.,& Veloso, M. (2001). Rational and convergent learning in stochastic games. In International joint conference on artificial intelligence (Vol. 17, pp. 1021\u20131026), Seattle, WA: Citeseer."},{"key":"295_CR6","unstructured":"Burke, E.,& Bykov, Y. (2008). A late acceptance strategy in hill-climbing for exam timetabling problems. In Proceedings of the 7th international conference on the practice and theory of automated timetabling (PATAT\u20192008), Montreal."},{"key":"295_CR7","doi-asserted-by":"crossref","unstructured":"Burke, E., Hart, E., Kendall, G., Newall, J., Ross, P.,& Schulenburg, S. (2003a). chap. hyper-heuristics: An emerging direction in modern search technology (pp. 457\u2013474). Handbook of meta-heuristics. Dordrecht: Kluwer.","DOI":"10.1007\/0-306-48056-5_16"},{"key":"295_CR8","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M.,& Kendall, G. (2006a). Evolving bin packing heuristics with genetic programming. In T. Runarsson, H.-G. Beyer., E. Burke, J. Merelo-Guervos, L. Whitley,& X. Yao (Eds.), Proceedings of the 9th international conference on parallel problem solving from nature (PPSN\u201906). LNCS (Vol. 4193 pp. 860\u2013869). Reykjavik: Springer.","DOI":"10.1007\/11844297_87"},{"key":"295_CR9","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E.,& Woodward, J. (2010a). A classification of hyper-heuristic approaches. Handbook of metaheuristics (pp. 449\u2013468). New York: Springer.","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"295_CR10","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M., Kendall, G.,& Woodward, J. (2007). Automatic heuristic generation with genetic programming: Evolving a jack-of-all-trades or a master of one. In H. Lipson (Ed.), Proceedings of genetic and evolutionary computation conference (GECCO\u201907) (pp. 1559\u20131565), London.","DOI":"10.1145\/1276958.1277273"},{"key":"295_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E., Hyde, M., Kendall, G.,& Woodward, J. (2010b). A genetic programming hyper-heuristic approach for evolving two dimensional strip packing heuristics. IEEE Transactions on Evolutionary Computation, 14(6), 942\u2013958.","DOI":"10.1109\/TEVC.2010.2041061"},{"key":"295_CR12","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G., Silva, D., O\u2019Brien, R.,& Soubeiga, E. (2005). An ant algorithm hyperheuristic for the project presentation scheduling problem. In Proceedings of the IEEE congress on evolutionary computation (CEC\u201905) (Vol. 3, pp. 2263\u20132270).","DOI":"10.1109\/CEC.2005.1554976"},{"key":"295_CR13","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G., M\u0131s\u0131r, M.,& \u00d6zcan, E. (2012). Monte carlo hyper-heuristics for examination timetabling. Annals of Operations Research, 196(1), 73\u201390.","DOI":"10.1007\/s10479-010-0782-2"},{"key":"295_CR14","doi-asserted-by":"crossref","unstructured":"Burke, E., Kendall, G.,& Soubeiga, E. (2003b). A tabu-search hyper-heuristic for timetabling and rostering. Journal of Heuristics, 9(3), 451\u2013470.","DOI":"10.1023\/B:HEUR.0000012446.94732.b6"},{"key":"295_CR15","doi-asserted-by":"crossref","unstructured":"Burke, E., Petrovic, S.,& Qu, R. (2006b). Case based heuristic selection for timetabling problems. Journal of Scheduling, 9(2), 115\u2013132.","DOI":"10.1007\/s10951-006-6775-y"},{"key":"295_CR16","unstructured":"Chakhlevitch, K.,& Cowling, P. (2005). Choosing the fittest subset of low level heuristics in a hyperheuristic framework. In G. Raidl& J. Gottlieb (Eds.), Evolutionary computation in combinatorial optimization. LNCS (Vol. 3448, pp. 23\u201333). Berlin\/Heidelberg: Springer."},{"key":"295_CR17","unstructured":"Cowling, P., Kendall, G.,& Soubeiga, E. (2001). A hyperheuristic approach to scheduling a sales summit. In E. K. Burke& W. Erben (Eds.), Selected papers from the 3rd international conference on practice and theory of automated timetabling (PATAT\u201900). LNCS (Vol. 2079, pp. 176\u2013190). London: Springer."},{"key":"295_CR18","volume-title":"A hyflex module for the personnel scheduling problem","author":"T Curtois","year":"2010","unstructured":"Curtois, T., Ochoa, G., Hyde, M.,& V\u00e1zquez-Rodr\u00edguez, J. A. (2010). A hyflex module for the personnel scheduling problem. CS Technical Report : University of Nottingham, Nottinghamshire."},{"key":"295_CR19","unstructured":"Demeester, P., Causmaecker, P. D.,& Vanden Berghe, G. (2010). A general approach for exam timetabling: A real-world and a benchmark case. In Proceedings of the 8th international conference on the practice and theory of automated timetabling (PATAT\u201910) (pp. 486\u2013489), Belfast."},{"key":"295_CR20","doi-asserted-by":"crossref","unstructured":"Dowsland, K., Soubeiga, E.,& Burke, E. (2007). A simulated annealing hyper-heuristic for determining shipper sizes. European Journal of Operational Research, 179(3), 759\u2013774.","DOI":"10.1016\/j.ejor.2005.03.058"},{"key":"295_CR21","doi-asserted-by":"crossref","unstructured":"Fukunaga, A. (2008). Automated discovery of local search heuristics for satisfiability testing. Evolutionary Computation, 16(1), 31\u201361.","DOI":"10.1162\/evco.2008.16.1.31"},{"key":"295_CR22","unstructured":"Han, L.,& Kendall, G. (2003). An investigation of a tabu assisted hyper-heuristic genetic algorithm. In Proceedings of the IEEE congress on evolutionary computation (CEC\u201903) (Vol. 3, pp. 2230\u20132237)."},{"key":"295_CR23","volume-title":"HyFlex competition instance summary","author":"M Hyde","year":"2011","unstructured":"Hyde, M.,& Ochoa, G. (2011). HyFlex competition instance summary. CS Technical Report : University of Nottingham, Nottinghamshire."},{"key":"295_CR24","volume-title":"A hyflex module for the maximum satisfiability (MAX-SAT) problem","author":"M Hyde","year":"2010","unstructured":"Hyde, M., Ochoa, G., Curtois, T.,& V\u00e1zquez-Rodr\u00edguez, J. A. (2010a). A hyflex module for the maximum satisfiability (MAX-SAT) problem. CS Technical Report : University of Nottingham, Nottinghamshire."},{"key":"295_CR25","volume-title":"A hyflex module for the one dimensional bin packing problem","author":"M Hyde","year":"2010","unstructured":"Hyde, M., Ochoa, G., Curtois, T.,& V\u00e1zquez-Rodr\u00edguez, J. A. (2010b). A hyflex module for the one dimensional bin packing problem. CS Technical Report : University of Nottingham, Nottinghamshire."},{"key":"295_CR26","doi-asserted-by":"crossref","unstructured":"Kendall, G.,& Hussin, N. (2005a). An investigation of a tabu-search-based hyper-heuristic for examination timetabling. Selected papers from the 1st international conference on multidisciplinary scheduling: Theory and applications (MISTA\u201903) (pp. 309\u2013328). Nottingham: Springer.","DOI":"10.1007\/0-387-27744-7_15"},{"key":"295_CR27","doi-asserted-by":"crossref","unstructured":"Kendall, G.,& Hussin, N. (2005b). A tabu search hyper-heuristic approach to the examination timetabling problem at the mara university of technology. In E. Burke& M. Trick (Eds.), Proceedings of the 5th international conference on practice and theory of automated timetabling (PATAT\u201904). LNCS (Vol. 3616, pp. 270\u2013293). Berlin: Springer.","DOI":"10.1007\/11593577_16"},{"key":"295_CR28","doi-asserted-by":"crossref","unstructured":"Kendall, G.,& Mohamad, M. (2004). Channel assignment in cellular communication using a great deluge hyper-heuristic. In Proceedings of the 12th IEEE international conference on network (ICON\u201904) (pp. 769\u2013773).","DOI":"10.1109\/ICON.2004.1409283"},{"key":"295_CR29","doi-asserted-by":"crossref","unstructured":"Lee, D., Vassiliadis, V.,& Park, J. (2002). List-based threshold-accepting algorithm for zero-wait scheduling of multiproduct batch plants. Industrial& Engineering Chemistry Research, 41(25), 6579\u20136588.","DOI":"10.1021\/ie010570n"},{"key":"295_CR30","unstructured":"Mar\u00edn-Bl\u00e1zquez, J.,& Schulenburg, S. (2007). A hyper-heuristic framework with XCS: Learning to create novel problem-solving algorithms constructed from simpler algorithmic ingredients. In T. Kovacs, X. Llor\u00e0, K. Takadama, P. Lanzi, W. Stolzmann,& S. Wilson (Eds.), Selected papers from the international workshops on learning classifier systems (IWLCS\u201903-05). LNCS (Vol. 4399, pp. 193\u2013218). Berlin: Springer."},{"key":"295_CR31","unstructured":"M\u0131s\u0131r, M., Smet, P., Verbeeck, K.,& Vanden Berghe, G. (2011a). Security personnel routing and rostering: A hyper-heuristic approach. In Proceedings of the 3rd international conference on applied operational research (ICAOR\u201911). LNCS (Vol. 3, pp. 193\u2013205), Istanbul."},{"key":"295_CR32","unstructured":"M\u0131s\u0131r, M., Vancroonenburg, W.,& Vanden Berghe, G. (2011b). A selection hyper-heuristic for scheduling deliveries of ready-mixed concrete. In Proceedings of the 9th metaheuristic international conference (MIC\u201911), Udine."},{"key":"295_CR33","doi-asserted-by":"crossref","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P.,& Vanden Berghe, G. (2010). Hyper-heuristics with a dynamic heuristic set for the home care scheduling problem. In Proceedings of the IEEE congress on evolutionary computation (CEC\u201910) (pp. 2875\u20132882), Barcelona.","DOI":"10.1109\/CEC.2010.5586348"},{"key":"295_CR34","unstructured":"M\u0131s\u0131r, M., Wauters, T., Verbeeck, K.,& Vanden Berghe, G. (2009). A new learning hyper-heuristic for the traveling tournament problem. In Proceedings of the 8th metaheuristic international conference (MIC\u201909), Hamburg."},{"key":"295_CR35","unstructured":"Nareyek, A. (2003). Metaheuristics: Computer decision-making, chap. Choosing search heuristics by non-stationary reinforcement learning (pp. 523\u2013544). Dordrecht: Kluwer."},{"key":"295_CR36","unstructured":"Ochoa, G., Hyde, M., Curtois, T., V\u00e1zquez-Rodr\u00edguez, J., Walker, J., Gendreau, M., Kendall, G., McCollum, B., Parkes, A., Petrovic, S.,& Burke, E. (2012). Hyflex: A benchmark framework for cross-domain heuristic search. In J.-K. Hao& M. Middendorf (Eds.), Proceedings of the 12th European conference on evolutionary computation in combinatorial optimisation (EvoCOP\u201912). LNCS (Vol. 7245, pp. 136\u2013147). Berlin: Springer."},{"issue":"1","key":"295_CR37","doi-asserted-by":"crossref","first-page":"3","DOI":"10.3233\/IDA-2008-12102","volume":"12","author":"E \u00d6zcan","year":"2008","unstructured":"\u00d6zcan, E., Bilgin, B.,& Korkmaz, E. (2008). A comprehensive analysis of hyper-heuristics. Intelligent Data Analysis, 12(1), 3\u201323.","journal-title":"Intelligent Data Analysis"},{"issue":"1","key":"295_CR38","doi-asserted-by":"crossref","first-page":"39","DOI":"10.4018\/jamc.2010102603","volume":"1","author":"E \u00d6zcan","year":"2010","unstructured":"\u00d6zcan, E., M\u0131s\u0131r, M., Ochoa, G.,& Burke, E. (2010). A reinforcement learning\u2013Great-deluge hyper-heuristic for examination timetabling. International Journal of Applied Metaheuristic Computing, 1(1), 39\u201359.","journal-title":"International Journal of Applied Metaheuristic Computing"},{"key":"295_CR39","first-page":"942","volume-title":"Proceedings of the 4th annual conference on genetic and evolutionary computation (GECCO\u201902)","author":"P Ross","year":"2002","unstructured":"Ross, P., Schulenburg, S., Mar\u00edn-Bl\u00e1zquez, J.,& Hart, E. (2002). Hyper-heuristics: Learning to combine simple heuristics in bin-packing problems. In W. B. Langdon, E. Cant\u00fa-Paz, K. Mathias, R. Roy, D. Davis, R. Poli, K. Balakrishnan, V. Honavar, G. Rudolph, J. Wegener, L. Bull, M. A. Potter, A. C. Schultz, J. F. Miller, E. Burke,& N. Jonoska (Eds.), Proceedings of the 4th annual conference on genetic and evolutionary computation (GECCO\u201902) (pp. 942\u2013948). New York: Morgan Kaufmann Publishers."},{"key":"295_CR40","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9052-5","volume-title":"Networks of learning automata: Techniques for online stochastic optimization","author":"M Thathachar","year":"2004","unstructured":"Thathachar, M.,& Sastry, P. (2004). Networks of learning automata: Techniques for online stochastic optimization. Boston: Kluwer."},{"key":"295_CR41","volume-title":"A hyflex module for the permutation flow shop problem","author":"JA V\u00e1zquez-Rodr\u00edguez","year":"2010","unstructured":"V\u00e1zquez-Rodr\u00edguez, J. A., Ochoa, G., Curtois, T.,& Hyde, M. (2010). A hyflex module for the permutation flow shop problem. CS Technical Report : University of Nottingham, Nottinghamshire."},{"key":"295_CR42","unstructured":"Walker, J., Ochoa, G., Gendreau, M.,& Burke, E. (2012). Vehicle routing and adaptive iterated local search within the HyFlex hyper-heuristic framework. In Y. Hamadi& M. Schoenauer (Eds.), Proceedings of the 6th learning and intelligent optimization conference (LION\u201912). LNCS (Vol. 7219). Paris: Springer."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0295-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-012-0295-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-012-0295-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,5]],"date-time":"2019-07-05T16:12:39Z","timestamp":1562343159000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-012-0295-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,14]]},"references-count":42,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,6]]}},"alternative-id":["295"],"URL":"https:\/\/doi.org\/10.1007\/s10951-012-0295-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,14]]}}}