TY - GEN
T1 - A New Learnheuristic
AU - Becerra-Rozas, Marcelo
AU - Lemus-Romani, José
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - Cisternas-Caneo, Felipe
AU - Embry, Andrés Trujillo
AU - Molina, Máximo Arnao A.
AU - Tapia, Diego
AU - Castillo, Mauricio
AU - Rubio, José Miguel
N1 - Funding Information:
Broderick Crawford is supported by Grant CONICYT/ FONDECYT/REGULAR/1210810. Broderick Crawford, Ricardo Soto and Marcelo Becerra-Rozas are supported by Grant Nucleo de Investigacion en Data Ana-lytics/VRIEA/PUCV/039.432/2020. Ricardo Soto is supported by Grant CONI-CYT/FONDECYT/REGULAR/1190129. Marcelo Becerra-Rozas are supported by Grant DI Investigaci?n Interdisciplinaria del Pregrado/VRIEA/PUCV/039.421/2021. Marcelo Becerra-Rozas is supported by National Agency for Research and Development (ANID)/Scholarship Program/DOCTORADO NACIONAL/2021-21210740. Jos? Lemus-Romani is supported by National Agency for Research and Development (ANID)/Scholarship Program/DOCTORADO NACIONAL/2019-21191692.
Publisher Copyright:
© 2022, Springer Nature Switzerland AG.
PY - 2022
Y1 - 2022
N2 - 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.
AB - 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.
KW - Combinatorial problem
KW - Learnheuristic
KW - SARSA
KW - Sine Cosine Algorithm
UR - http://www.scopus.com/inward/record.url?scp=85126216546&partnerID=8YFLogxK
U2 - 10.1007/978-3-030-94216-8_10
DO - 10.1007/978-3-030-94216-8_10
M3 - Conference contribution
AN - SCOPUS:85126216546
SN - 9783030942151
T3 - Communications in Computer and Information Science
SP - 127
EP - 136
BT - Metaheuristics and Nature Inspired Computing - 8th International Conference, META 2021, Proceedings
A2 - Dorronsoro, Bernabé
A2 - Yalaoui, Farouk
A2 - Talbi, El-Ghazali
A2 - Danoy, Grégoire
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 27 October 2021 through 30 October 2021
ER -