{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T04:51:48Z","timestamp":1754110308377,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031216855"},{"type":"electronic","value":"9783031216862"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-21686-2_4","type":"book-chapter","created":{"date-parts":[[2022,11,18]],"date-time":"2022-11-18T08:30:15Z","timestamp":1668760215000},"page":"45-60","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["The Impact of State Representation on Approximate Q-Learning for a Selection Hyper-heuristic"],"prefix":"10.1007","author":[{"given":"Augusto","family":"Dantas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aurora","family":"Pozo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,19]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1023\/A:1013689704352","volume":"47","author":"P Auer","year":"2002","unstructured":"Auer, P., Cesa-Bianchi, N., Fischer, P.: Finite-time analysis of the multiarmed bandit problem. Mach. Learn. 47(2), 235\u2013256 (2002)","journal-title":"Mach. Learn."},{"issue":"6","key":"4_CR2","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: a survey. Appl. Soft Comput. 11(6), 4135\u20134151 (2011)","journal-title":"Appl. Soft Comput."},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Burke, E.K., Hyde, M., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.R.: A classification of hyper-heuristic approaches. In: Gendreau, M., Potvin, JY. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 449\u2013468. Springer, Boston (2010). https:\/\/doi.org\/10.1007\/978-1-4419-1665-5_15","DOI":"10.1007\/978-1-4419-1665-5_15"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Buzdalova, A., Kononov, V., Buzdalov, M.: Selecting evolutionary operators using reinforcement learning: initial explorations. In: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 1033\u20131036 (2014)","DOI":"10.1145\/2598394.2605681"},{"key":"4_CR5","unstructured":"Fialho, \u00c1.: Adaptive Operator Selection for Optimization. Universit\u00e9 Paris Sud - Paris XI (Dec, Theses (2010)"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"Handoko, S.D., Nguyen, D.T., Yuan, Z., Lau, H.C.: Reinforcement learning for adaptive operator selection in memetic search applied to quadratic assignment problem. In: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary Computation, pp. 193\u2013194. GECCO Comp 2014, Association for Computing Machinery, New York, NY, USA (2014)","DOI":"10.1145\/2598394.2598451"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C.D., Jr., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983)","DOI":"10.1126\/science.220.4598.671"},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/TEVC.2013.2239648","volume":"18","author":"K Li","year":"2014","unstructured":"Li, K., Fialho, \u00c1., Kwong, S., Zhang, Q.: Adaptive operator selection with bandits for a multiobjective evolutionary algorithm based on decomposition. IEEE Trans. Evolution. Comput. 18(1), 114\u2013130 (2014)","journal-title":"IEEE Trans. Evolution. Comput."},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"M\u0131s\u0131r, M., Verbeeck, K., De Causmaecker, P., Berghe, G.V.: 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","DOI":"10.1007\/978-3-642-34413-8_45"},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1016\/j.ejor.2019.09.021","volume":"282","author":"H Mosadegh","year":"2020","unstructured":"Mosadegh, H., Ghomi, S.F., S\u00fcer, G.A.: Stochastic mixed-model assembly line sequencing problem: mathematical modeling and q-learning based simulated annealing hyper-heuristics. Eur. J. Oper. Res. 282(2), 530\u2013544 (2020)","journal-title":"Eur. J. Oper. Res."},{"key":"4_CR11","doi-asserted-by":"publisher","unstructured":"Ochoa, G., et al.: HyFlex: a benchmark framework for cross-domain heuristic search. In: Hao, J.K., Middendorf, M. (eds.) European Conference on Evolutionary Computation in Combinatorial Optimisation(EvoCOP 2012), LNCS, vol. 7245, pp. 136\u2013147. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29124-1_12","DOI":"10.1007\/978-3-642-29124-1_12"},{"key":"4_CR12","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"Sharma, M., Komninos, A., L\u00f3pez-Ib\u00e1\u00f1ez, M., Kazakov, D.: Deep reinforcement learning based parameter control in differential evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 709\u2013717 (2019)","DOI":"10.1145\/3321707.3321813"},{"issue":"3","key":"4_CR14","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."},{"key":"4_CR15","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning, Second Edition: An Introduction. MIT Press (2018)"},{"key":"4_CR16","doi-asserted-by":"publisher","unstructured":"Teng, T.H., Handoko, S.D., Lau, H.C.: Self-organizing neural network for adaptive operator selection in evolutionary search. In: Festa, P., Sellmann, M., Vanschoren, J. (eds.) Learning and Intelligent Optimization. LNTCS, vol 10079, pp. 187\u2013202. LNCS, Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-50349-3_13","DOI":"10.1007\/978-3-319-50349-3_13"},{"issue":"3","key":"4_CR17","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/BF00992698","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3), 279\u2013292 (1992)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Intelligent Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-21686-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T17:09:15Z","timestamp":1709831355000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-21686-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031216855","9783031216862"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-21686-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"19 November 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BRACIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazilian Conference on Intelligent Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Campinas","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Brazil","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":"28 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 December 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bracis2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www2.sbc.org.br\/bracis2022\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"JEMS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"225","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"89","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}