Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlea C.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:41Z
dc.date.available2020-09-02T22:15:41Z
dc.date.issued2015
dc.identifier10.1109/CISTI.2015.7170537
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4157
dc.descriptionIn 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.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectBinary Bat Optimization Algorithm
dc.subjectCombinatorial Optimization
dc.subjectMetaheuristic
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBins
dc.subjectCombinatorial optimization
dc.subjectInformation systems
dc.subjectOptimization
dc.subjectBat algorithms
dc.subjectDiscretizations
dc.subjectMetaheuristic
dc.subjectOptimization algorithms
dc.subjectSet covering problem
dc.subjectProblem solving
dc.titleBinary bat algorithms for the set covering problem [Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos]
dc.typeConference Paper


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record