{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,11]],"date-time":"2026-07-11T05:59:02Z","timestamp":1783749542386,"version":"3.55.0"},"publisher-location":"New York, NY, USA","reference-count":28,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,16]],"date-time":"2013-01-16T00:00:00Z","timestamp":1358294400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,16]]},"DOI":"10.1145\/2460239.2460249","type":"proceedings-article","created":{"date-parts":[[2013,4,9]],"date-time":"2013-04-09T12:19:32Z","timestamp":1365509972000},"page":"97-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["A runtime analysis of simple hyper-heuristics"],"prefix":"10.1145","author":[{"given":"Per Kristian","family":"Lehre","sequence":"first","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[{"name":"University of Nottingham, Nottingham, United Kingdom"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2013,1,16]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Inc.","author":"Auger A.","year":"2011"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-010-0782-2"},{"key":"e_1_3_2_1_3_1","series-title":"International Series in Operations Research and Management Science","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/978-1-4419-1665-5_15","volume-title":"M. Gendreau and J.-Y","author":"Burke E. K.","year":"2010"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-79438-7_1"},{"key":"e_1_3_2_1_6_1","unstructured":"T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. McGraw Hill New York NY 2nd edition 2001.   T. H. Cormen C. E. Leiserson R. L. Rivest and C. Stein. Introduction to Algorithms. McGraw Hill New York NY 2nd edition 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"Practice and Theory of Automated Timetabling III: Third International Conference, PATAT 2000","volume":"2079","author":"Cowling P.","year":"2000"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"P.\n       \n      Cowling G.\n       \n      Kendall and \n      \n      \n      E.\n       \n      Soubeiga\n      \n  \n  . \n  Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In S. Cagoni J. Gottlieb E. Hart M. Middendorf and R. Goenther editors Applications of Evolutionary Computing: Proceeding of Evo Workshops\n   \n  2002 volume \n  2279\n   of \n  Lecture Notes in Computer Science pages \n  1\n  --\n  10 Kinsale Ireland April 3-4 2002. \n  Springer-Verlag\n  .   P. Cowling G. Kendall and E. Soubeiga. Hyperheuristics: A tool for rapid prototyping in scheduling and optimisation. In S. Cagoni J. Gottlieb E. Hart M. Middendorf and R. Goenther editors Applications of Evolutionary Computing: Proceeding of Evo Workshops 2002 volume 2279 of Lecture Notes in Computer Science pages 1--10 Kinsale Ireland April 3-4 2002. Springer-Verlag.","DOI":"10.1007\/3-540-46004-7_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00182-7"},{"key":"e_1_3_2_1_10_1","volume-title":"Wiley","author":"Feller W.","year":"1968"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1885031.1885085"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1143997.1144095"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29124-1_19"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:NACO.0000023417.31393.c7"},{"key":"e_1_3_2_1_15_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/3-540-45712-7_4","volume-title":"J. J. M. Guerv\u00f3s, P. Adamidis, H.-G. Beyer, J. L. F.-V. Mart\u00edn, and H.-P","author":"Jansen T.","year":"2002"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/4235.974841"},{"key":"e_1_3_2_1_17_1","first-page":"16","volume-title":"Mendel 2009:  15th International Conference on Soft Computing","author":"Maden I.","year":"2009"},{"key":"e_1_3_2_1_18_1","volume-title":"Department of Computer Engineering","author":"M\u0131s\u0131r M.","year":"2008"},{"key":"e_1_3_2_1_19_1","first-page":"245","volume-title":"Proceedings of the First European Conference on Artificial Life, 1991","author":"Mitchell M.","year":"1992"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/211390"},{"key":"e_1_3_2_1_21_1","first-page":"523","volume-title":"Metaheuristics","author":"Nareyek A.","year":"2004"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer-Verlag New York Inc. New York NY USA 1st edition 2010.   F. Neumann and C. Witt. Bioinspired Computation in Combinatorial Optimization: Algorithms and Their Computational Complexity. Springer-Verlag New York Inc. New York NY USA 1st edition 2010.","DOI":"10.1007\/978-3-642-16544-3_2"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1569901.1569949"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.5555\/1689599.1689846"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/1368027.1368029"},{"key":"e_1_3_2_1_26_1","volume-title":"International Journal of Applied Metaheuristic Computing (IJAMC), 1(1):39--59","author":"\u00d6zcan E.","year":"2010"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2005.09.012"},{"key":"e_1_3_2_1_28_1","volume-title":"Springer","author":"Ross P.","year":"2005"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.03.047"}],"event":{"name":"FOGA '13: Foundations of Genetic Algorithms XII","location":"Adelaide Australia","acronym":"FOGA '13","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the twelfth workshop on Foundations of genetic algorithms XII"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2460239.2460249","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2460239.2460249","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:46Z","timestamp":1750234726000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2460239.2460249"}},"subtitle":["to mix or not to mix operators"],"short-title":[],"issued":{"date-parts":[[2013,1,16]]},"references-count":28,"alternative-id":["10.1145\/2460239.2460249","10.1145\/2460239"],"URL":"https:\/\/doi.org\/10.1145\/2460239.2460249","relation":{},"subject":[],"published":{"date-parts":[[2013,1,16]]},"assertion":[{"value":"2013-01-16","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}