Mostrar el registro sencillo del ítem
Using binary fruit fly algorithm for solving the set covering problem [Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura]
dc.contributor.author | Crawford B. | |
dc.contributor.author | Soto R. | |
dc.contributor.author | Torres-Rojas C. | |
dc.contributor.author | Peña C. | |
dc.contributor.author | Riquelme-Leiva M. | |
dc.contributor.author | Johnson F. | |
dc.contributor.author | Paredes F. | |
dc.date.accessioned | 2020-09-02T22:16:12Z | |
dc.date.available | 2020-09-02T22:16:12Z | |
dc.date.issued | 2015 | |
dc.identifier | 10.1109/CISTI.2015.7170352 | |
dc.identifier.uri | https://hdl.handle.net/20.500.12728/4237 | |
dc.description | Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed. © 2015 AISTI. | |
dc.language.iso | es | |
dc.publisher | Institute of Electrical and Electronics Engineers Inc. | |
dc.subject | fruit fly optimization algorithm | |
dc.subject | metaheuristics | |
dc.subject | set covering problem | |
dc.subject | transfer functions | |
dc.subject | Bins | |
dc.subject | Factory automation | |
dc.subject | Fruits | |
dc.subject | Information systems | |
dc.subject | Optimization | |
dc.subject | Transfer functions | |
dc.subject | Algorithm for solving | |
dc.subject | Foraging behaviors | |
dc.subject | Fruit flies | |
dc.subject | Meta heuristics | |
dc.subject | Metaheuristic | |
dc.subject | Probability vector | |
dc.subject | Selection methods | |
dc.subject | Set covering problem | |
dc.subject | Algorithms | |
dc.title | Using binary fruit fly algorithm for solving the set covering problem [Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura] | |
dc.type | Conference Paper |