{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T06:35:17Z","timestamp":1743143717489,"version":"3.40.3"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031340192"},{"type":"electronic","value":"9783031340208"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-34020-8_19","type":"book-chapter","created":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:02:30Z","timestamp":1685095350000},"page":"248-259","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Multi-armed Bandit-Based Metaheuristic Operator Selection: The Pendulum Algorithm Binarization Case"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4013-6001","authenticated-orcid":false,"given":"Pablo","family":"\u00c1brego-Calder\u00f3n","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5500-0188","authenticated-orcid":false,"given":"Broderick","family":"Crawford","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5755-6929","authenticated-orcid":false,"given":"Ricardo","family":"Soto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0333-0633","authenticated-orcid":false,"given":"Eduardo","family":"Rodriguez-Tello","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7723-7012","authenticated-orcid":false,"given":"Felipe","family":"Cisternas-Caneo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7970-1368","authenticated-orcid":false,"given":"Eric","family":"Monfroy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2809-5120","authenticated-orcid":false,"given":"Giovanni","family":"Giachetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,27]]},"reference":[{"key":"19_CR1","doi-asserted-by":"crossref","unstructured":"Ab. Aziz, N.A., Ab. Aziz, K.: Pendulum search algorithm: an optimization algorithm based on simple harmonic motion and its application for a vaccine distribution problem. Algorithms 15(6) (2022)","DOI":"10.3390\/a15060214"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"9358","DOI":"10.1109\/ACCESS.2017.2777894","volume":"6","author":"TA Rahman","year":"2018","unstructured":"Rahman, T.A., Ibrahim, Z., Ab. Aziz, N.A., Zhao, S., Aziz, N.H.A.: Single-agent finite impulse response optimizer for numerical optimization problems. IEEE Access 6, 9358\u20139374 (2018)","journal-title":"IEEE Access"},{"issue":"20","key":"19_CR3","doi-asserted-by":"publisher","first-page":"7110","DOI":"10.3390\/app10207110","volume":"10","author":"R Alizadeh","year":"2020","unstructured":"Alizadeh, R., Nishi, T.: Hybrid set covering and dynamic modular covering location problem: Application to an emergency humanitarian logistics problem. Appl. Sci. 10(20), 7110 (2020)","journal-title":"Appl. Sci."},{"issue":"19","key":"19_CR4","doi-asserted-by":"publisher","first-page":"1876","DOI":"10.1016\/j.tcs.2009.01.016","volume":"410","author":"J-Y Audibert","year":"2009","unstructured":"Audibert, J.-Y., Munos, R., Szepesv\u00e1ri, C.: Exploration-exploitation tradeoff using variance estimates in multi-armed bandits. Theoret. Comput. Sci. 410(19), 1876\u20131902 (2009)","journal-title":"Theoret. Comput. Sci."},{"issue":"2","key":"19_CR5","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":"1","key":"19_CR6","doi-asserted-by":"publisher","first-page":"129","DOI":"10.3390\/math11010129","volume":"11","author":"M Becerra-Rozas","year":"2022","unstructured":"Becerra-Rozas, M., et al.: Continuous metaheuristics for binary optimization problems: an updated systematic literature review. Mathematics 11(1), 129 (2022)","journal-title":"Mathematics"},{"key":"19_CR7","doi-asserted-by":"crossref","unstructured":"Crawford, B., Soto, R., Astorga, G., Garc\u00eda, J., Castro, C., Paredes, F.: Putting continuous metaheuristics to work in binary search spaces. Complexity 2017 (2017)","DOI":"10.1155\/2017\/8404231"},{"key":"19_CR8","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1007\/978-3-319-66963-2_50","volume-title":"Applied Computer Sciences in Engineering","author":"B Crawford","year":"2017","unstructured":"Crawford, B., Soto, R., Monfroy, E., Astorga, G., Garc\u00eda, J., Cortes, E.: A meta-optimization approach for covering problems in facility location. In: Figueroa-Garc\u00eda, J.C., L\u00f3pez-Santana, E.R., Villa-Ram\u00edrez, J.L., Ferro-Escobar, R. (eds.) WEA 2017. CCIS, vol. 742, pp. 565\u2013578. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66963-2_50"},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"DaCosta, L., Fialho, A., Schoenauer, M., Sebag, M.: Adaptive operator selection with dynamic multi-armed bandits. In: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation, pp. 913\u2013920 (2008)","DOI":"10.1145\/1389095.1389272"},{"issue":"4","key":"19_CR10","first-page":"12","volume":"9","author":"G Elena","year":"2021","unstructured":"Elena, G., Milos, K., Eugene, I.: Survey of multiarmed bandit algorithms applied to recommendation systems. Int. J. Open Inf. Technol. 9(4), 12\u201327 (2021)","journal-title":"Int. J. Open Inf. Technol."},{"key":"19_CR11","doi-asserted-by":"crossref","unstructured":"Lanza-Gutierrez, J.M., Caballe, N.C., Crawford, B., Soto, R., Gomez-Pulido, J.A., Paredes, F.: Exploring further advantages in an alternative formulation for the set covering problem. Math. Probl. Eng. 2020 (2020)","DOI":"10.1155\/2020\/5473501"},{"key":"19_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/j.eswa.2016.10.054","volume":"70","author":"JM Lanza-Gutierrez","year":"2017","unstructured":"Lanza-Gutierrez, J.M., Crawford, B., Soto, R., Berrios, N., Gomez-Pulido, J.A., Paredes, F.: Analyzing the effects of binarization techniques when solving the set covering problem through swarm optimization. Expert Syst. Appl. 70, 67\u201382 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"22","key":"19_CR13","doi-asserted-by":"publisher","first-page":"2887","DOI":"10.3390\/math9222887","volume":"9","author":"J Lemus-Romani","year":"2021","unstructured":"Lemus-Romani, J., et al.: A novel learning-based binarization scheme selector for swarm algorithms solving combinatorial problems. Mathematics 9(22), 2887 (2021)","journal-title":"Mathematics"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"2545","DOI":"10.1007\/s00500-020-05263-2","volume":"25","author":"S Mandal","year":"2021","unstructured":"Mandal, S., Patra, N., Pal, M.: Covering problem on fuzzy graphs and its application in disaster management system. Soft. Comput. 25(4), 2545\u20132557 (2021)","journal-title":"Soft. Comput."},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Patil, V., Ghalme, G., Nair, V., Narahari, Y.: Achieving fairness in the stochastic multi-armed bandit problem. In: AAAI, pp. 5379\u20135386 (2020)","DOI":"10.1609\/aaai.v34i04.5986"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"40258","DOI":"10.1109\/ACCESS.2019.2906840","volume":"7","author":"E Rodriguez-Tello","year":"2019","unstructured":"Rodriguez-Tello, E., Narvaez-Teran, V., Lardeux, F.: Dynamic multi-armed bandit algorithm for the cyclic bandwidth sum problem. IEEE Access 7, 40258\u201340270 (2019)","journal-title":"IEEE Access"},{"issue":"2","key":"19_CR17","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. Progr. Artif. Intell. 8(2), 143\u2013165 (2019). https:\/\/doi.org\/10.1007\/s13748-019-00185-z","journal-title":"Progr. Artif. Intell."},{"issue":"9","key":"19_CR18","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.3390\/math8091389","volume":"8","author":"R Soto","year":"2020","unstructured":"Soto, R., et al.: A reactive population approach on the dolphin echolocation algorithm for solving cell manufacturing systems. Mathematics 8(9), 1389 (2020)","journal-title":"Mathematics"},{"key":"19_CR19","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"2018","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction, 2nd edn. The MIT Press, Cambridge (2018)","edition":"2"},{"key":"19_CR20","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E-G Talbi","year":"2009","unstructured":"Talbi, E.-G.: Metaheuristics: From Design to Implementation. Wiley, Hoboken (2009)"},{"key":"19_CR21","doi-asserted-by":"crossref","unstructured":"Xiang, X., Qiu, J., Xiao, J., Zhang, X.: Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems. Eng. Appl. Artif. Intell. 91, 103582 (2020)","DOI":"10.1016\/j.engappai.2020.103582"},{"key":"19_CR22","first-page":"176","volume":"3","author":"\u00c1 Fialho","year":"2009","unstructured":"Fialho, \u00c1., Da Costa, L., Schoenauer, M., Sebag, M.: Dynamic multi-armed bandits and extreme value-based rewards for adaptive operator selection in evolutionary algorithms. LION 3, 176\u2013190 (2009)","journal-title":"LION"}],"container-title":["Communications in Computer and Information Science","Optimization and Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34020-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T10:09:41Z","timestamp":1685095781000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34020-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031340192","9783031340208"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34020-8_19","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"27 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"OLA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Optimization and Learning","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Malaga","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Spain","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":"3 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2023.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"sciencesconf.org","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"78","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":"32","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":"41% - 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":"3","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)"}}]}}