{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,11]],"date-time":"2025-11-11T13:43:13Z","timestamp":1762868593778,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030856717"},{"type":"electronic","value":"9783030856724"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-85672-4_6","type":"book-chapter","created":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:02:30Z","timestamp":1629147750000},"page":"74-85","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A Comparison of Learnheuristics Using Different Reward Functions to Solve the Set Covering Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5500-0188","authenticated-orcid":false,"given":"Broderick","family":"Crawford","sequence":"first","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-0001-7723-7012","authenticated-orcid":false,"given":"Felipe","family":"Cisternas-Caneo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0603-3722","authenticated-orcid":false,"given":"Diego","family":"Tapia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2564-8770","authenticated-orcid":false,"given":"Hanns","family":"de la Fuente-Mella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7232-0412","authenticated-orcid":false,"given":"Wenceslao","family":"Palma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5379-0315","authenticated-orcid":false,"given":"Jos\u00e9","family":"Lemus-Romani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7804-6381","authenticated-orcid":false,"given":"Mauricio","family":"Castillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0426-0144","authenticated-orcid":false,"given":"Marcelo","family":"Becerra-Rozas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,8,17]]},"reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"106280","DOI":"10.1016\/j.asoc.2020.106280","volume":"92","author":"C Bayliss","year":"2020","unstructured":"Bayliss, C., Juan, A.A., Currie, C.S., Panadero, J.: A learnheuristic approach for the team orienteering problem with aerial drone motion constraints. Appl. Soft Comput. 92, 106280 (2020)","journal-title":"Appl. Soft Comput."},{"key":"6_CR2","doi-asserted-by":"crossref","unstructured":"Cisternas-Caneo, F., et al.: A data-driven dynamic discretization framework to solve combinatorial problems using continuous metaheuristics. In: Innovations in Bio-Inspired Computing and Applications, pp. 76\u201385. Springer International Publishing, Cham (2021)","DOI":"10.1007\/978-3-030-73603-3_7"},{"key":"6_CR3","unstructured":"Crawford, B., de la Barra, C.L.: Los algoritmos ambidiestros (2020). https:\/\/www.mercuriovalpo.cl\/impresa\/2020\/07\/13\/full\/cuerpo-principal\/15\/. Accessed 2 December 2021"},{"key":"6_CR4","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":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1007\/3-540-61723-X_1029","volume-title":"Parallel Problem Solving from Nature \u2014 PPSN IV","author":"M Dorigo","year":"1996","unstructured":"Dorigo, M., Gambardella, L.M.: A study of some properties of Ant-Q. In: Voigt, H.-M., Ebeling, W., Rechenberg, I., Schwefel, H.-P. (eds.) PPSN 1996. LNCS, vol. 1141, pp. 656\u2013665. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/3-540-61723-X_1029"},{"key":"6_CR6","unstructured":"Ecoffet, A., Huizinga, J., Lehman, J., Stanley, K.O., Clune, J.: Go-explore: a new approach for hard-exploration problems. arXiv preprint arXiv:1901.10995 (2019)"},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10015-010-0822-7","volume":"15","author":"T Fuchida","year":"2010","unstructured":"Fuchida, T., Aung, K.T., Sakuragi, A.: A study of q-learning considering negative rewards. Artif. Life Robot. 15(3), 351\u2013354 (2010)","journal-title":"Artif. Life Robot."},{"key":"6_CR8","unstructured":"Michael, R.G., David, S.J.: Computers and intractability: a guide to the theory of np-completeness (1979)"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"147596","DOI":"10.1109\/ACCESS.2019.2946664","volume":"7","author":"K Hussain","year":"2019","unstructured":"Hussain, K., Zhu, W., Salleh, M.N.M.: Long-term memory harris$$\\prime $$ hawk optimization for high dimensional and optimal power flow problems. IEEE Access 7, 147596\u2013147616 (2019)","journal-title":"IEEE Access"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Lanza-Gutierrez, J.M., et al.: Exploring further advantages in an alternative formulation for the set covering problem. Mathematical Problems in Engineering (2020)","DOI":"10.1155\/2020\/5473501"},{"key":"6_CR11","first-page":"833","volume":"20","author":"A Lazaric","year":"2007","unstructured":"Lazaric, A., Restelli, M., Bonarini, A.: Reinforcement learning in continuous action spaces through sequential monte carlo methods. Adv. Neural. Inf. Process. Syst. 20, 833\u2013840 (2007)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"6_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1007\/978-3-030-58817-5_65","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2020","author":"J Lemus-Romani","year":"2020","unstructured":"Lemus-Romani, J., et al.: Ambidextrous socio-cultural algorithms. In: Gervasi, O., et al. (eds.) ICCSA 2020. LNCS, vol. 12254, pp. 923\u2013938. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-58817-5_65"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.knosys.2015.12.022","volume":"96","author":"S Mirjalili","year":"2016","unstructured":"Mirjalili, S.: SCA: a sine cosine algorithm for solving optimization problems. Knowl. Based Syst. 96, 120\u2013133 (2016)","journal-title":"Knowl. Based Syst."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Morales-Casta\u00f1eda, B., Zaldivar, D., Cuevas, E., Fausto, F., Rodr\u00edguez, A.: A better balance in metaheuristic algorithms: does it exist? Swarm Evolut. Comput. 54, 100671 (2020)","DOI":"10.1016\/j.swevo.2020.100671"},{"key":"6_CR15","doi-asserted-by":"publisher","unstructured":"Nareyek, A.: Choosing search heuristics by non-stationary reinforcement learning. In: Metaheuristics: Computer Decision-Making. Applied Optimization, vol. 86. Springer, Boston, MA (2003). https:\/\/doi.org\/10.1007\/978-1-4757-4137-7_25","DOI":"10.1007\/978-1-4757-4137-7_25"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jmsy.2018.11.005","volume":"50","author":"O Xinyan","year":"2019","unstructured":"Xinyan, O., Chang, Q., Chakraborty, N.: Simulation study on reward function of reinforcement learning in gantry work cell scheduling. J. Manuf. Syst. 50, 1\u20138 (2019)","journal-title":"J. Manuf. Syst."},{"key":"6_CR17","doi-asserted-by":"crossref","unstructured":"Park, Y., Nielsen, P., Moon, I.: Unmanned aerial vehicle set covering problem considering fixed-radius coverage constraint. Comput. Oper. Res. 119, 104936 (2020)","DOI":"10.1016\/j.cor.2020.104936"},{"issue":"1\u20133","key":"6_CR18","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01589402","volume":"42","author":"BM Smith","year":"1988","unstructured":"Smith, B.M.: Impacs-a bus crew scheduling system using integer programming. Math. Program. 42(1\u20133), 181\u2013187 (1988)","journal-title":"Math. Program."},{"key":"6_CR19","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT press, Cambridge (2018)"},{"key":"6_CR20","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-3-030-61702-8_2","volume-title":"Applied Informatics","author":"D Tapia","year":"2020","unstructured":"Tapia, D., et al.: A q-learning hyperheuristic binarization framework to balance exploration and exploitation. In: Florez, H., Misra, S. (eds.) ICAI 2020. CCIS, vol. 1277, pp. 14\u201328. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61702-8_2"},{"key":"6_CR21","doi-asserted-by":"crossref","unstructured":"Tapia, D., et al.: Embedding q-learning in the selection of metaheuristic operators: the enhanced binary grey wolf optimizar case. In: Proceeding of 2021 IEEE International Conference on Automation\/XXIV Congress of the Chilean Association of Automatic Control (ICA-ACCA), IEEE ICA\/ACCA 2021, ARTICLE IN PRESS (2021)","DOI":"10.1109\/ICAACCA51523.2021.9465259"},{"key":"6_CR22","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1016\/j.compchemeng.2018.11.008","volume":"121","author":"SSV Vianna","year":"2019","unstructured":"Vianna, S.S.V.: The set covering problem applied to optimisation of gas detectors in chemical process plants. Comput. Chem. Eng. 121, 388\u2013395 (2019)","journal-title":"Comput. Chem. Eng."},{"issue":"3\u20134","key":"6_CR23","first-page":"279","volume":"8","author":"CJ Watkins","year":"1992","unstructured":"Watkins, C.J., Dayan, P.: Q-learning. Mach. Learn. 8(3\u20134), 279\u2013292 (1992)","journal-title":"Mach. Learn."},{"key":"6_CR24","doi-asserted-by":"crossref","unstructured":"Zamli, K.Z., Din, F., Ahmed, B.S., Bures, M.: A hybrid q-learning sine-cosine-based strategy for addressing the combinatorial test suite minimization problem. PloS one 13(5), e0195675 (2018)","DOI":"10.1371\/journal.pone.0195675"},{"key":"6_CR25","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.apenergy.2015.07.057","volume":"157","author":"L Zhang","year":"2015","unstructured":"Zhang, L., Shaffer, B., Brown, T., Scott Samuelsen, G.: The optimization of dc fast charging deployment in california. Appl. Energy 157, 111\u2013122 (2015)","journal-title":"Appl. Energy"}],"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-030-85672-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,16]],"date-time":"2021-08-16T21:04:23Z","timestamp":1629147863000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-85672-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030856717","9783030856724"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-85672-4_6","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"17 August 2021","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":"Catania","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 June 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ola2021a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ola2021.sciencesconf.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","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":"62","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":"27","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":"44% - 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)"}},{"value":"Due to the COVID-19 pandemic the conference was held in a virtual mode.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}