Mostrar el registro sencillo del ítem
Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos]
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Olea C. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:15:41Z | |
dc.date.available | 2020-09-02T22:15:41Z | |
dc.date.issued | 2015 | |
dc.identifier | 10.1109/CISTI.2015.7170537 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4157 | |
dc.description | 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. © 2015 AISTI. | |
dc.language.iso | es | |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
dc.subject | Binary Bat Optimization Algorithm | |
dc.subject | Combinatorial Optimization | |
dc.subject | Metaheuristic | |
dc.subject | Set Covering Problem | |
dc.subject | Algorithms | |
dc.subject | Bins | |
dc.subject | Combinatorial optimization | |
dc.subject | Information systems | |
dc.subject | Optimization | |
dc.subject | Bat algorithms | |
dc.subject | Discretizations | |
dc.subject | Metaheuristic | |
dc.subject | Optimization algorithms | |
dc.subject | Set covering problem | |
dc.subject | Problem solving | |
dc.title | Binary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos] | |
dc.type | Conference Paper |