Mostrar el registro sencillo del ítem

Solving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight]

dc.contributor.authorSoto R.
dc.contributor.authorCrawford B.
dc.contributor.authorBarraza J.
dc.contributor.authorJohnson F.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:28:39Z
dc.date.available2020-09-02T22:28:39Z
dc.date.issued2015
dc.identifier10.1109/CISTI.2015.7170589
dc.identifier.urihttps://hdl.handle.net/20.500.12728/6289
dc.descriptionCuckoo search is a modern bio-inspired metaheuristic that has successfully been used to solve different real world optimization problems. In particular, it has exhibited rapid convergence reaching considerable good results. In this paper, we employ this technique to solve the set covering problem, which is a well-known optimization benchmark. We illustrate interesting experimental results where the proposed algorithm is able to obtain several global optimums for different set covering instances from the OR-Library. © 2015 AISTI.
dc.language.isoes
dc.publisherInstitute of Electrical and Electronics Engineers Inc.
dc.subjectArtificial Intelligence
dc.subjectBio-Inspired Models
dc.subjectSet Covering Problem
dc.subjectArtificial intelligence
dc.subjectFactory automation
dc.subjectInformation systems
dc.subjectBio-inspired Models
dc.subjectCuckoo searches
dc.subjectGlobal optimum
dc.subjectMetaheuristic
dc.subjectRapid convergence
dc.subjectReal-world optimization
dc.subjectSet covering problem
dc.subjectSet coverings
dc.subjectOptimization
dc.titleSolving pre-processed set covering problems via cuckoo search and lévy flights [Resolviendo Problemas Pre-Procesados de Cobertura de Conjuntos vía Cuckoo Search y Lévy Flight]
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem