{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T16:43:50Z","timestamp":1751993030664,"version":"3.40.3"},"publisher-location":"Cham","reference-count":41,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031539657"},{"type":"electronic","value":"9783031539664"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-53966-4_16","type":"book-chapter","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:02:29Z","timestamp":1707933749000},"page":"206-221","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Reinforcement Learning for\u00a0Multi-Neighborhood Local Search in\u00a0Combinatorial Optimization"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1191-1929","authenticated-orcid":false,"given":"Sara","family":"Ceschia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9560-6301","authenticated-orcid":false,"given":"Roberto Maria","family":"Rosati","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6965-0536","authenticated-orcid":false,"given":"Andrea","family":"Schaerf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,2,15]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"1633","DOI":"10.1613\/jair.1.13922","volume":"75","author":"S Adriaensen","year":"2022","unstructured":"Adriaensen, S., et al.: Automated dynamic algorithm configuration. J. Artif. Intell. Res. 75, 1633\u20131699 (2022)","journal-title":"J. Artif. Intell. Res."},{"key":"16_CR2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105272","volume":"131","author":"M Alicastro","year":"2021","unstructured":"Alicastro, M., Ferone, D., Festa, P., Fugaro, S., Pastore, T.: A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. Comput. Oper. Res. 131, 105272 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"16_CR3","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/s10951-006-7187-8","volume":"9","author":"A Anagnostopoulos","year":"2006","unstructured":"Anagnostopoulos, A., Michel, L., Van Hentenryck, P., Vergados, Y.: A simulated annealing approach to the traveling tournament problem. J. Sched. 9(2), 177\u2013193 (2006)","journal-title":"J. Sched."},{"key":"16_CR4","unstructured":"Bartz-Beielstein, T., et al.: Benchmarking in optimization: best practice and open issues. CoRR, arXiv abs\/2007.03488 (2020)"},{"key":"16_CR5","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105300","volume":"132","author":"R Bellio","year":"2021","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A.: Two-stage multi-neighborhood simulated annealing for uncapacitated examination timetabling. Comput. Oper. Res. 132, 105300 (2021)","journal-title":"Comput. Oper. Res."},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.cor.2015.07.002","volume":"65","author":"R Bellio","year":"2016","unstructured":"Bellio, R., Ceschia, S., Di Gaspero, L., Schaerf, A., Urli, T.: Feature-based tuning of simulated annealing applied to the curriculum-based course timetabling problem. Comput. Oper. Res. 65, 83\u201392 (2016)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"16_CR7","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR8","doi-asserted-by":"publisher","unstructured":"Burke, E.K., Hyde, M.R., Kendall, G., Ochoa, G., \u00d6zcan, E., Woodward, J.: A classification of hyper-heuristic approaches: revisited. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 272, pp. 453\u2013477. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_14","DOI":"10.1007\/978-3-319-91086-4_14"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1057\/jors.1996.37","volume":"74","author":"M Carter","year":"1996","unstructured":"Carter, M., Laporte, G., Lee, S.: Examination timetabling: algorithmic strategies and applications. J. Oper. Res. Soc. 74, 373\u2013383 (1996)","journal-title":"J. Oper. Res. Soc."},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.07.011","volume":"308","author":"S Ceschia","year":"2023","unstructured":"Ceschia, S., Di Gaspero, L., Schaerf, A.: Educational timetabling: problems, benchmarks, and state-of-the-art results. Eur. J. Oper. Res. 308(1), 1\u201318 (2023)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR11","doi-asserted-by":"publisher","unstructured":"Doerr, B., Doerr, C.: Theory of parameter control for discrete black-box optimization: provable performance gains through dynamic parameter choices. In: Doerr, B., Neumann, F. (eds.) Theory of Evolutionary Computation. NCS, pp. 271\u2013321. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-29414-4_6","DOI":"10.1007\/978-3-030-29414-4_6"},{"issue":"1\u20132","key":"16_CR12","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10472-010-9213-y","volume":"60","author":"A Fialho","year":"2010","unstructured":"Fialho, A., Da Costa, L., Schoenauer, M., Sebag, M.: Analyzing bandit-based adaptive operator selection mechanisms. Ann. Math. Artif. Intell. 60(1\u20132), 25\u201364 (2010)","journal-title":"Ann. Math. Artif. Intell."},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.cor.2018.12.015","volume":"104","author":"A Franzin","year":"2019","unstructured":"Franzin, A., St\u00fctzle, T.: Revisiting simulated annealing: a component-based analysis. Comput. Oper. Res. 104, 191\u2013206 (2019)","journal-title":"Comput. Oper. Res."},{"key":"16_CR14","unstructured":"Glover, F., Kochenberger, G.: Handbook of Metaheuristics, vol. 57. Springer, Berlin, Heidelberg (2006). ISBN 978-1402072635"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/j.cie.2018.05.016","volume":"121","author":"A Gunawan","year":"2018","unstructured":"Gunawan, A., Lau, H.C., Lu, K.: Adopt: combining parameter tuning and adaptive operator ordering for solving a class of orienteering problems. Comput. Ind. Eng. 121, 82\u201396 (2018)","journal-title":"Comput. Ind. Eng."},{"issue":"2","key":"16_CR16","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1109\/TEVC.2019.2921598","volume":"24","author":"C Huang","year":"2020","unstructured":"Huang, C., Li, Y., Yao, X.: A survey of automatic parameter tuning methods for metaheuristics. IEEE Trans. Evolut. Comput. 24(2), 201\u2013216 (2020)","journal-title":"IEEE Trans. Evolut. Comput."},{"key":"16_CR17","doi-asserted-by":"publisher","unstructured":"Hutter, F., Hoos, H., Leyton-Brown, K.: Sequential model-based optimization for general algorithm configuration. In: Coello, C.A.C. (eds.) Learning and Intelligent Optimization. LION 2011. LNCS, vol. 6683, pp. 507\u2013523. Springer, Berlin, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25566-3_40","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"16_CR18","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC-instance-specific algorithm configuration. In: ECAI 2010, pp. 751\u2013756. IOS Press (2010)"},{"issue":"1","key":"16_CR19","doi-asserted-by":"publisher","first-page":"446","DOI":"10.1016\/j.ejor.2023.01.017","volume":"309","author":"J Kallestad","year":"2023","unstructured":"Kallestad, J., Hasibi, R., Hemmati, A., S\u00f6rensen, K.: A general deep reinforcement learning hyperheuristic framework for solving combinatorial optimization problems. Eur. J. Oper. Res. 309(1), 446\u2013468 (2023)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"16_CR20","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1016\/j.ejor.2021.04.032","volume":"296","author":"M Karimi-Mamaghan","year":"2022","unstructured":"Karimi-Mamaghan, M., Mohammadi, M., Meyer, P., Karimi-Mamaghan, A., Talbi, E.G.: Machine learning at the service of meta-heuristics for solving combinatorial optimization problems: a state-of-the-art. Eur. J. Oper. Res. 296(2), 393\u2013422 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR21","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2021.105221","volume":"130","author":"A Kheiri","year":"2021","unstructured":"Kheiri, A., Gretsista, A., Keedwell, E., Lulli, G., Epitropakis, M., Burke, E.: A hyper-heuristic approach based upon a hidden Markov model for the multi-stage nurse rostering problem. Comput. Oper. Res. 130, 105221 (2021)","journal-title":"Comput. Oper. Res."},{"key":"16_CR22","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.artint.2015.11.002","volume":"232","author":"A KhudaBukhsh","year":"2016","unstructured":"KhudaBukhsh, A., Xu, L., Hoos, H., Leyton-Brown, K.: SATenstein: automatically building local search SAT solvers from components. Artif. Intell. 232, 20\u201342 (2016)","journal-title":"Artif. Intell."},{"key":"16_CR23","unstructured":"Lamaz-Fernandez, C., Martinez-Sykora, A., Potts, C.: Scheduling double round-robin sports tournaments. In: Proceedings of the 13th International Conference on the Practice and Theory of Automated Timetabling, vol. 2 (2021)"},{"issue":"7","key":"16_CR24","doi-asserted-by":"publisher","first-page":"3551","DOI":"10.1016\/j.eswa.2014.12.004","volume":"42","author":"J Li","year":"2015","unstructured":"Li, J., Pardalos, P.M., Sun, H., Pei, J., Zhang, Y.: Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Syst. Appl. 42(7), 3551\u20133561 (2015)","journal-title":"Expert Syst. Appl."},{"key":"16_CR25","first-page":"43","volume":"3","author":"M L\u00f3pez-Ib\u00e1\u00f1ez","year":"2016","unstructured":"L\u00f3pez-Ib\u00e1\u00f1ez, M., Dubois-Lacoste, J., C\u00e1ceres, L.P., Birattari, M., St\u00fctzle, T.: The irace package: iterated racing for automatic algorithm configuration. Oper. Res. Perspect. 3, 43\u201358 (2016)","journal-title":"Oper. Res. Perspect."},{"issue":"3","key":"16_CR26","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1016\/j.ejor.2011.12.016","volume":"218","author":"Z L\u00fc","year":"2012","unstructured":"L\u00fc, Z., Hao, J.K.: Adaptive neighborhood search for nurse rostering. Eur. J. Oper. Res. 218(3), 865\u2013876 (2012)","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR27","doi-asserted-by":"crossref","unstructured":"Mara, S., Norcahyo, R., Jodiawan, P., Lusiantoro, L., Rifai, A.P.: A survey of adaptive large neighborhood search algorithms and applications. Comput. Oper. Res. 146(105903) (2022)","DOI":"10.1016\/j.cor.2022.105903"},{"issue":"1","key":"16_CR28","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/A:1006556606079","volume":"11","author":"O Maron","year":"1997","unstructured":"Maron, O., Moore, A.: The racing algorithm: model selection for lazy learners. Artif. Intell. Rev. 11(1), 193\u2013225 (1997)","journal-title":"Artif. Intell. Rev."},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Mischek, F., Musliu, N.: Reinforcement learning for cross-domain hyper-heuristics. In: Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence IJCAI-22, pp. 4793\u20134799 (2022)","DOI":"10.24963\/ijcai.2022\/664"},{"issue":"2","key":"16_CR30","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., S\u00fcer, G.: 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":"16_CR31","doi-asserted-by":"publisher","unstructured":"Pisinger, D., Ropke, S.: Large neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 272, pp. 99\u2013127. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91086-4_4","DOI":"10.1007\/978-3-319-91086-4_4"},{"issue":"3","key":"16_CR32","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/s10951-022-00740-y","volume":"25","author":"RM Rosati","year":"2022","unstructured":"Rosati, R.M., Petris, M., Di Gaspero, L., Schaerf, A.: Multi-neighborhood simulated annealing for the sports timetabling competition ITC2021. J. Sched. 25(3), 301\u2013319 (2022)","journal-title":"J. Sched."},{"issue":"10","key":"16_CR33","doi-asserted-by":"publisher","first-page":"4939","DOI":"10.1016\/j.eswa.2014.01.040","volume":"41","author":"J dos Santos","year":"2014","unstructured":"dos Santos, J., de Melo, J., Neto, A., Aloise, D.: Reactive search strategies using reinforcement learning, local search algorithms and variable neighborhood search. Expert Syst. Appl. 41(10), 4939\u20134949 (2014)","journal-title":"Expert Syst. Appl."},{"key":"16_CR34","doi-asserted-by":"publisher","unstructured":"Schneider, M., Hoos, H.: Quantifying homogeneity of instance sets for algorithm configuration. In: Hamadi, Y., Schoenauer, M. (eds.) Learning and Intelligent Optimization. LION 2012. LNCS, vol. 7219, pp. 190\u2013204. Springer, Berlin, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-34413-8_14","DOI":"10.1007\/978-3-642-34413-8_14"},{"key":"16_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.cie.2019.106134","volume":"139","author":"A Shahmardan","year":"2020","unstructured":"Shahmardan, A., Sajadieh, M.: Truck scheduling in a multi-door cross-docking center with partial unloading-reinforcement learning-based simulated annealing approaches. Comput. Ind. Eng. 139, 106134 (2020)","journal-title":"Comput. Ind. Eng."},{"key":"16_CR36","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.cor.2013.11.015","volume":"45","author":"K Smith-Miles","year":"2014","unstructured":"Smith-Miles, K., Baatar, D., Wreford, B., Lewis, R.: Towards objective measures of algorithm performance across instance space. Comput. Oper. Res. 45, 12\u201324 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"16_CR37","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s13748-019-00185-z","volume":"8","author":"H Song","year":"2019","unstructured":"Song, H., Triguero, I., \u00d6zcan, E.: A review on the self and dual interactions between machine learning and optimisation. Progress Artif. Intell. 8(2), 143\u2013165 (2019)","journal-title":"Progress Artif. Intell."},{"key":"16_CR38","unstructured":"Sutton, R., Barto, A.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (2018)"},{"issue":"6","key":"16_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3459664","volume":"54","author":"EG Talbi","year":"2021","unstructured":"Talbi, E.G.: Machine learning into metaheuristics: a survey and taxonomy. ACM Comput. Surv. (CSUR) 54(6), 1\u201332 (2021)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"16_CR40","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.cor.2017.08.002","volume":"89","author":"TA Toffolo","year":"2018","unstructured":"Toffolo, T.A., Christiaens, J., Van Malderen, S., Wauters, T., Vanden Berghe, G.: Stochastic local search with learning automaton for the swap-body vehicle routing problem. Comput. Oper. Res. 89, 68\u201381 (2018)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"16_CR41","doi-asserted-by":"publisher","first-page":"1249","DOI":"10.1016\/j.ejor.2022.11.046","volume":"308","author":"D Van Bulck","year":"2023","unstructured":"Van Bulck, D., Goossens, D.: The international timetabling competition on sports timetabling (ITC2021). Eur. J. Oper. Res. 308(3), 1249\u20131267 (2023)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Data Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-53966-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T18:04:42Z","timestamp":1707933882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-53966-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031539657","9783031539664"],"references-count":41,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-53966-4_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"15 February 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Machine Learning, Optimization, and Data Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grasmere","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mod2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lod2023.icas.cc\/","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":"In-house system and EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"119","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":"72","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":"61% - 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":"5-6","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":"1-2","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}