DocumentCode
727877
Title
Binary bat algorithms for the set covering problem
Author
Crawford, Broderick ; Soto, Ricardo ; Olea, Claudia ; Johnson, Franklin ; Paredes, Fernando
Author_Institution
Pontificia Univ. Catolica de Valparaiso, Valparaiso, Chile
fYear
2015
fDate
17-20 June 2015
Firstpage
1
Lastpage
4
Abstract
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.
Keywords
bioacoustics; combinatorial mathematics; optimisation; binary bat algorithms; combinatorial optimization; discretization techniques; echo-localization; set covering problem; transfer techniques; Algorithm design and analysis; Computational modeling; Europe; Genetics; Optimization; Robustness; Silicon; Binary Bat Optimization Algorithm; Combinatorial Optimization; Metaheuristic; Set Covering Problem;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Systems and Technologies (CISTI), 2015 10th Iberian Conference on
Conference_Location
Aveiro
Type
conf
DOI
10.1109/CISTI.2015.7170537
Filename
7170537
Link To Document