Title
Binary bat algorithms for the set covering problem
Other title
Algoritmos Murciélago Binarios para el Problema de Cobertura de Conjuntos
Date Issued
28 July 2015
Access level
metadata only access
Resource Type
conference paper
Author(s)
Crawford B.
SOTO DE GIORGIS, RICARDO
Olea C.
Johnson F.
Paredes F.
Pontificia Universidad Católica de Valparaíso
Publisher(s)
Institute of Electrical and Electronics Engineers Inc.
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.
Language
English
OCDE Knowledge area
Informática y Ciencias de la Información Ingeniería de sistemas y comunicaciones
Subjects
DOI
10.1109/CISTI.2015.7170537
Scopus EID
2-s2.0-84943311556
ISBN of the container
978-989984345-5
DOI of the container
10.1109/CISTI.2015.7170537
Conference
2015 10th Iberian Conference on Information Systems and Technologies, CISTI 2015
Sources of information: Directorio de Producción Científica Scopus