{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:35:27Z","timestamp":1742942127796,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319190839"},{"type":"electronic","value":"9783319190846"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-19084-6_7","type":"book-chapter","created":{"date-parts":[[2015,5,28]],"date-time":"2015-05-28T14:43:01Z","timestamp":1432824181000},"page":"74-88","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning a Hidden Markov Model-Based Hyper-heuristic"],"prefix":"10.1007","author":[{"given":"Willem","family":"Van Onsem","sequence":"first","affiliation":[]},{"given":"Bart","family":"Demoen","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"De Causmaecker","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,29]]},"reference":[{"key":"7_CR1","unstructured":"Khamassi, I.: Ant-Q hyper heuristic approach applied to the cross-domain heuristic search challenge problems. In: CHeSC 2011 (2011)"},{"key":"7_CR2","doi-asserted-by":"crossref","unstructured":"McClymont, K., Keedwell, E.: A single objective variant of the online selective Markov chain Hyper-heuristic (MCHH-S). In: CHeSC 2011 (2011)","DOI":"10.1145\/2001576.2001845"},{"key":"7_CR3","unstructured":"Wikipedia: Probability vector \u2013 wikipedia, the free encyclopedia (2014). Accessed 24 Sep 2014"},{"issue":"6","key":"7_CR4","doi-asserted-by":"crossref","first-page":"2193","DOI":"10.1016\/j.physa.2011.12.004","volume":"391","author":"A Lipowski","year":"2012","unstructured":"Lipowski, A., Lipowska, D.: Roulette-wheel selection via stochastic acceptance. Phys. A Stat. Mech. Appl. 391(6), 2193\u20132196 (2012)","journal-title":"Phys. A Stat. Mech. Appl."},{"key":"7_CR5","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)"},{"key":"7_CR6","unstructured":"Watkins, C.J.C.H.: Learning from delayed rewards. Ph.D. thesis, King\u2019s College, Cambridge, UK, May 1989"},{"key":"7_CR7","unstructured":"Gaspero, L.D., Urli, T.: A reinforcement learning approach for the cross-domain heuristic search challenge. In: CHeSC 2011 (2011)"},{"key":"7_CR8","unstructured":"M\u0131s\u0131r, M., De Causmaecker, P., Vanden Berghe, G., Verbeeck, K.: An adaptive hyper-heuristic for CHeSC 2011. In: CHeSC 2011 (2011)"},{"key":"7_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, vol. 7219, pp. 461\u2013466. Springer, Heidelberg (2012)"},{"issue":"1\u20132","key":"7_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0166-218X(01)00263-3","volume":"119","author":"F Glover","year":"2002","unstructured":"Glover, F., Hanafi, S.: Tabu search and finite convergence. Discrete Appl. Math. 119(1\u20132), 3\u201336 (2002)","journal-title":"Discrete Appl. Math."},{"key":"7_CR11","doi-asserted-by":"crossref","unstructured":"Burke, E.K., Curtois, T., Hyde, M.R., Kendall, G., Ochoa, G., Petrovic, S., Rodr\u00edguez, J.A.V., Gendreau, M.: Iterated local search vs. hyper-heuristics: towards general-purpose search algorithms. In: IEEE Congress on Evolutionary Computation, pp. 1\u20138. IEEE (2010)","DOI":"10.1109\/CEC.2010.5586064"},{"key":"7_CR12","unstructured":"Bause, F.: Input-output hidden markov models for the aggregation of performance models. Sfb Teilprojekt M and Ls Informatik Iv and Modellierung Grosser and Sfb Teilprojekt M SFB559-03010, Universit\u00e4t Dortmund, Dortmund, July 2003"},{"key":"7_CR13","doi-asserted-by":"crossref","unstructured":"Markovitch, S., Scott, P.D.: The role of forgetting in learning. In: Laird, J.E. (ed.) ML, pp. 459\u2013465. Morgan Kaufmann, Ann Arbor (1988)","DOI":"10.1016\/B978-0-934613-64-4.50052-9"},{"key":"7_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/978-3-642-44973-4_43","volume-title":"Learning and Intelligent Optimization","author":"S Asta","year":"2013","unstructured":"Asta, S., \u00d6zcan, E., Parkes, A.J.: Batched mode hyper-heuristics. In: Nicosia, G., Pardalos, P. (eds.) LION 7. LNCS, vol. 7997, pp. 404\u2013409. Springer, Heidelberg (2013)"},{"key":"7_CR15","unstructured":"Van Onsem, W., Demoen, B., De Causmaecker, P.: HHaaHHM: hyper-heuristics as a hidden Markov model. In: Proceedings of the Cross-domain Heuristic Selection Competition 2014, April 2014"},{"key":"7_CR16","unstructured":"Pihera, J., Musliu, N.: ETHH - evolving tree hyper-heuristic. In: Proceedings of the Cross-domain Heuristic Selection Competition 2014, April 2014"}],"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-319-19084-6_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T01:17:36Z","timestamp":1676942256000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19084-6_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319190839","9783319190846"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19084-6_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"29 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}