Mostrar el registro sencillo del ítem

Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlivares-Suárez M.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:43Z
dc.date.available2020-09-02T22:15:43Z
dc.date.issued2014
dc.identifier10.1007/978-3-319-07857-1_89
dc.identifier.citation434 PART I, , 509-514
dc.identifier.issn18650929
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4164
dc.descriptionThe Weighted Set Covering Problem is a formal model for many practical optimization problems. In this problem the goal is to choose a subset of columns of minimal cost covering every row. Here, a Binary Firefly Algorithm has been developed to tackle the Weighted Set Covering Problem. Firefly Algorithm is a recently developed population-based metaheuristic inspired by the flashing behaviour of fireflies. Experimental results show that our approach is competitive solving the problem at hand. © Springer International Publishing Switzerland 2014.
dc.language.isoen
dc.publisherSpringer Verlag
dc.subjectFirefly Algorithm
dc.subjectSwarm Intelligence
dc.subjectWeighted Set Covering Problem
dc.subjectBioluminescence
dc.subjectFire protection
dc.subjectOptimization
dc.subjectFirefly algorithms
dc.subjectFormal model
dc.subjectMetaheuristic
dc.subjectMinimal cost
dc.subjectOptimization method
dc.subjectOptimization problems
dc.subjectSwarm Intelligence
dc.subjectWeighted set covering problems
dc.subjectProblem solving
dc.titleUsing the Firefly Optimization Method to Solve the Weighted Set Covering Problem
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem