A New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA)
| dc.catalogador | jlo | |
| dc.contributor.author | Becerra-Rozas, Marcelo | |
| dc.contributor.author | Lemus Romani, José Isaac | |
| dc.contributor.author | Crawford, Broderick | |
| dc.contributor.author | Soto, Ricardo | |
| dc.contributor.author | Cisternas Caneo, Felipe | |
| dc.contributor.author | Trujillo Embry, Andrés | |
| dc.contributor.author | Arnao Molina, Máximo | |
| dc.contributor.author | Tapia, Diego | |
| dc.contributor.author | Castillo, Mauricio | |
| dc.contributor.author | Rubio, José Miguel | |
| dc.date.accessioned | 2026-01-09T15:40:25Z | |
| dc.date.available | 2026-01-09T15:40:25Z | |
| dc.date.issued | 2022 | |
| dc.description.abstract | This paper proposes a novel learnheuristic called Binary SARSA - Sine Cosine Algorithm (BS-SCA) for solving combinatorial problems. The BS-SCA is a binary version of Sine Cosine Algorithm (SCA) using SARSA to select a binarization operator. This operator is required due SCA was created to work in continuous domains. The performance of BS-SCA is benchmarked with a Q-learning version of the learnheuristic. The problem tested was the Set Covering Problem and the results show the superiority of our proposal. | |
| dc.description.funder | ANID | |
| dc.description.funder | Grant Nucleo de Investigacion en Data Ana-lytics | |
| dc.description.funder | National Agency for Research and Development | |
| dc.description.funder | VRIEA | |
| dc.description.funder | CONICYT | |
| dc.description.funder | PUCV | |
| dc.fechaingreso.objetodigital | 2026-01-09 | |
| dc.format.extent | 10 páginas | |
| dc.fuente.origen | Scopus | |
| dc.identifier.doi | 10.1007/978-3-030-94216-8_10 | |
| dc.identifier.eissn | 1865-0937 | |
| dc.identifier.isbn | 9783030942151 | |
| dc.identifier.issn | 1865-0929 | |
| dc.identifier.scopusid | SCOPUS_ID:85126216546 | |
| dc.identifier.uri | https://doi.org/10.1007/978-3-030-94216-8_10 | |
| dc.identifier.uri | https://repositorio.uc.cl/handle/11534/107621 | |
| dc.identifier.wosid | WOS:000773472300010 | |
| dc.information.autoruc | Escuela de Construcción Civil; Lemus Romani, José Isaac; 0000-0001-5379-0315; 1223124 | |
| dc.language.iso | en | |
| dc.nota.acceso | contenido parcial | |
| dc.pagina.final | 136 | |
| dc.pagina.inicio | 127 | |
| dc.publisher | Springer Science and Business Media Deutschland GmbH | |
| dc.relation.ispartof | Metaheuristics and Nature Inspired Computing 8th International Conference, META 2021 Marrakech, Morocco, October 27–30, 2021 Proceedings | |
| dc.rights | acceso restringido | |
| dc.subject | Combinatorial problem | |
| dc.subject | Learnheuristic | |
| dc.subject | SARSA | |
| dc.subject | Sine Cosine Algorithm | |
| dc.subject.ddc | 620 | |
| dc.title | A New Learnheuristic: Binary SARSA - Sine Cosine Algorithm (BS-SCA) | |
| dc.type | comunicación de congreso | |
| sipa.codpersvinculados | 1223124 | |
| sipa.trazabilidad | SCOPUS;21-03-2022 |
