{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T04:11:29Z","timestamp":1742962289019,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642449727"},{"type":"electronic","value":"9783642449734"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-44973-4_43","type":"book-chapter","created":{"date-parts":[[2013,11,25]],"date-time":"2013-11-25T08:47:05Z","timestamp":1385369225000},"page":"404-409","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Batched Mode Hyper-heuristics"],"prefix":"10.1007","author":[{"given":"Shahriar","family":"Asta","sequence":"first","affiliation":[]},{"given":"Ender","family":"\u00d6zcan","sequence":"additional","affiliation":[]},{"given":"Andrew J.","family":"Parkes","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,11,26]]},"reference":[{"key":"43_CR1","first-page":"176","volume-title":"PATAT 2000. LNCS","author":"P Cowling","year":"2001","unstructured":"Cowling, P., Kendall, G., Soubeiga, E.: A hyperheuristic approach to scheduling a sales summit. In: Burke, E., Erben, W. (eds.) PATAT 2000. LNCS, vol. 2079, pp. 176\u2013190. Springer, Heidelberg (2001)"},{"issue":"5","key":"43_CR2","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1109\/TSMCC.2012.2188832","volume":"42","author":"X Chen","year":"2012","unstructured":"Chen, X., Ong, Y.S.: A conceptual modeling of meme complexes in stochastic search. IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev. 42(5), 612\u2013625 (2012)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C: Appl. Rev."},{"key":"43_CR3","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Qu, R.: Hyper-heuristics: a survey of the state of the art. Technical Report NOTTCS-TR-SUB-0906241418-2747, School of Computer Science, University of Nottingham (2010)"},{"issue":"1","key":"43_CR4","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.E.: A comprehensive analysis of hyper-heuristics. Intell. Data Anal. 12(1), 3\u201323 (2008)","journal-title":"Intell. Data Anal."},{"key":"43_CR5","first-page":"136","volume-title":"EvoCOP 2012. LNCS","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)"},{"key":"43_CR6","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Vanden Berghe, G.: A new hyper-heuristic implementation in HyFlex: a study on generality. In: Fowler, J., Kendall, G., McCollum, B. (eds.) Proceedings of the MISTA\u201911, pp. 374\u2013393 (2011)"},{"key":"43_CR7","volume-title":"Imprecise and Approximate Computation","author":"S Zilberstein","year":"1995","unstructured":"Zilberstein, S., Russell, S.J.: Approximate reasoning using anytime algorithms. In: Natarajan, S. (ed.) Imprecise and Approximate Computation. Kluwer Academic Publishers, The Netherlands (1995)"},{"key":"43_CR8","first-page":"1","volume-title":"EvoCOP 2013. LNCS","author":"A Kheiri","year":"2013","unstructured":"Kheiri, A., \u00d6zcan, E.: A Hyper-heuristic with a round robin neighbourhood selection. In: Middendorf, M., Blum, C. (eds.) EvoCOP 2013. LNCS, vol. 7832, pp. 1\u201312. Springer, Heidelberg (2013)"},{"key":"43_CR9","unstructured":"Parkes, A.J., Walser, J.P.: Tuning local search for satisfiability testing. In: Proceedings of AAAI 1996, pp. 356\u2013362 (1996)"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-44973-4_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,7]],"date-time":"2023-02-07T19:20:34Z","timestamp":1675797634000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-44973-4_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642449727","9783642449734"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-44973-4_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]},"assertion":[{"value":"26 November 2013","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}