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

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorTorres-Rojas, C.es_ES
dc.contributor.authorPeña, C.es_ES
dc.contributor.authorRiquelme-Leiva, M.es_ES
dc.contributor.authorMisra, S.es_ES
dc.contributor.authorJohnson, F.es_ES
dc.contributor.authorParedes, F.es_ES
dc.date.accessioned6/22/2022 14:20
dc.date.accessioned2022-06-22T19:51:05Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:05Z
dc.date.issued2015
dc.description.abstractThe 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.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-21410-832es_ES
dc.identifier.urihttps://link.springer.com/chapter/10.1007/978-3-319-21410-8_32es_PE
dc.language.isoen_USes_ES
dc.publisherSpringer Verlages_ES
dc.publisher.countryDEes_ES
dc.relation.ispartofLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.sourceLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)es_ES
dc.subjectComputer Sciencees_ES
dc.subjectMathematicses_ES
dc.subject.ocdehttp://purl.org/pe-repo/ocde/ford#2.02.04es_ES
dc.titleA binary fruit fly optimization algorithm to solve the set covering problemes_ES
dc.typeinfo:eu-repo/semantics/conferenceObjectes_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
3. A binary fruit fly optimization algorithm to solve the set covering problem.pdf
Tamaño:
579.02 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso