Mostrar el registro sencillo del ítem

A binary coded firefly algorithm that solves the set covering problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlivares-Suárez M.
dc.contributor.authorPalma W.
dc.contributor.authorParedes F.
dc.contributor.authorOlguín E.
dc.contributor.authorNorero E.
dc.date.accessioned2020-09-02T22:15:42Z
dc.date.available2020-09-02T22:15:42Z
dc.date.issued2014
dc.identifier.citation17, 3, 252-264
dc.identifier.issn14538245
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4162
dc.descriptionThis work presents a study of a new binary coded firefly algorithm. The firefly algorithm is a novel nature-inspired metaheuristic, inspired by the social behavior of fireflies, which is being applied to solve many optimization problems. We test the proposed binary coded firefly algorithm solving the non-unicost set covering problem which is a well-known NP-hard discrete optimization problem with many practical applications. To tackle the mapping from a continuous search space to a discrete search space we use different transfer functions which are investigated in terms of convergence speed and accuracy of results. The experimental results show the effectiveness of our approach where the binary coded firefly algorithm produce competitive results solving a portfolio of set covering problems from the OR-Library.
dc.language.isoen
dc.publisherEditura Academiei Romane
dc.subjectBinary firefly algorithm
dc.subjectMetaheuristic
dc.subjectSet covering problem
dc.titleA binary coded firefly algorithm that solves the set covering problem
dc.typeArticle


Ficheros en el ítem

Thumbnail
Nombre:
item_2-s2.0-84929623628.pdf
Tamaño:
1.955Kb
Formato:
PDF
Ver/

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

Mostrar el registro sencillo del ítem