Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos

Translated title of the contribution: Binary bat algorithms for the set covering problem

Broderick Crawford, Ricardo Soto, Claudia Olea, Franklin Johnson, Fernando Paredes

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

8 Scopus citations

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.

Translated title of the contributionBinary bat algorithms for the set covering problem
Original languageSpanish
Title of host publication2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
ISBN (Electronic)9789899843455
DOIs
StatePublished - 28 Jul 2015
Externally publishedYes
Event10th Iberian Conference on Information Systems and Technologies, CISTI 2015 - Aveiro, Portugal
Duration: 17 Jun 201520 Jun 2015

Publication series

Name2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015

Conference

Conference10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Country/TerritoryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint

Dive into the research topics of 'Binary bat algorithms for the set covering problem'. Together they form a unique fingerprint.

Cite this