Utilizando el Algoritmo binario Fruit Fly para resolver el Problema del Conjunto de Cobertura

Translated title of the contribution: Using binary fruit fly algorithm for solving the set covering problem

BRODERICK CRAWFORD LABRIN, RICARDO JAVIER SOTO DE GIORGIS, Claudio Torres-Rojas, Cristian Peña, Marco Riquelme-Leiva, Franklin Johnson, Fernando Paredes

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

Abstract

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.

Translated title of the contributionUsing binary fruit fly algorithm for solving 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
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
CountryPortugal
CityAveiro
Period17/06/1520/06/15

Fingerprint Dive into the research topics of 'Using binary fruit fly algorithm for solving the set covering problem'. Together they form a unique fingerprint.

Cite this