TY - GEN
T1 - Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos
AU - Crawford, Broderick
AU - Soto, Ricardo
AU - Olea, Claudia
AU - Johnson, Franklin
AU - Paredes, Fernando
N1 - Publisher Copyright:
© 2015 AISTI.
PY - 2015/7/28
Y1 - 2015/7/28
N2 - In the present paper, we resolve the Set Covering Problem using the recently presented meta-heuristic named Binary Bat Algorithm. We use two variations of this algorithm. The Binary Bat Algorithm algorithm was created observing how the bats evade obstacles and find preys to eat, the use of echo-localization is how they do it. We made some changes using two different transfer and two discretization techniques to solve the problem.
AB - In the present paper, we resolve the Set Covering Problem using the recently presented meta-heuristic named Binary Bat Algorithm. We use two variations of this algorithm. The Binary Bat Algorithm algorithm was created observing how the bats evade obstacles and find preys to eat, the use of echo-localization is how they do it. We made some changes using two different transfer and two discretization techniques to solve the problem.
KW - Binary Bat Optimization Algorithm
KW - Combinatorial Optimization
KW - Metaheuristic
KW - Set Covering Problem
UR - http://www.scopus.com/inward/record.url?scp=84943311556&partnerID=8YFLogxK
U2 - 10.1109/CISTI.2015.7170537
DO - 10.1109/CISTI.2015.7170537
M3 - Conference contribution
AN - SCOPUS:84943311556
T3 - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
BT - 2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Y2 - 17 June 2015 through 20 June 2015
ER -