A binary fruit fly optimization algorithm to solve the set covering problem

Crawford B.; Soto R.; Torres-Rojas C.; Peña C.; Riquelme-Leiva M.; Misra S.; Johnson F.; Paredes F.

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	Misra S.
dc.contributor.author	Johnson F.
dc.contributor.author	Paredes F.
dc.date.accessioned	2020-09-02T22:16:14Z
dc.date.available	2020-09-02T22:16:14Z
dc.date.issued	2015
dc.identifier	10.1007/978-3-319-21410-832
dc.identifier.citation	9158, , 411-420
dc.identifier.issn	03029743
dc.identifier.uri	https://hdl.handle.net/20.500.12728/4248
dc.description	The Set Covering Problem (SCP) is a well known NP-hard problem with many practical applications. In this work binary fruit fly optimization algorithms (bFFOA) were used to solve this problem using different binarization methods. The bFFOA is based on the food finding behavior of the fruit flies using osphresis and vision. The experimental results show the effectiveness of our algorithms producing competitive results when solve the benchmarks of SCP from the OR-Library. © Springer International Publishing Switzerland 2015.
dc.language.iso	en
dc.publisher	Springer Verlag
dc.source	Gavrilova M.L.Gervasi O.Murgante B.Misra S.Torre C.Taniar D.Apduhan B.O.Rocha A.M.A.C.Misra S.
dc.subject	Combinatorial optimization problem
dc.subject	Fruit Fly Optimization Algorithm
dc.subject	Metaheuristics
dc.subject	Set Covering Problem
dc.subject	Algorithms
dc.subject	Bins
dc.subject	Combinatorial optimization
dc.subject	Computational complexity
dc.subject	Fruits
dc.subject	Problem solving
dc.subject	Binarizations
dc.subject	Combinatorial optimization problems
dc.subject	Fruit flies
dc.subject	Meta heuristics
dc.subject	Set covering problem
dc.subject	Optimization
dc.title	A binary fruit fly optimization algorithm to solve the set covering problem
dc.type	Conference Paper

Ficheros en el ítem

Nombre:: item_2-s2.0-84948947184.pdf
Tamaño:: 2.313Kb
Formato:: PDF

Ver/

Este ítem aparece en la(s) siguiente(s) colección(ones)

Artículos científicos

Mostrar el registro sencillo del ítem

Repositorio Académico

A binary fruit fly optimization algorithm to solve the set covering problem

Ficheros en el ítem

Este ítem aparece en la(s) siguiente(s) colección(ones)

Ítems relacionados

A comparison of three recent nature-inspired metaheuristics for the set covering problem (2020) ﻿

Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020) ﻿

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] (2020) ﻿

A comparison of three recent nature-inspired metaheuristics for the set covering problem (2020)

Modified binary firefly algorithms with different transfer functions for solving set covering problems (2020)

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] (2020)