Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization

Vista sencilla de ítem
dc.contributor.authorCrawford, B.es_ES
dc.contributor.authorSoto, R.es_ES
dc.contributor.authorOlguín, E.es_ES
dc.contributor.authorMisra, S.es_ES
dc.contributor.authorVillablanca, S.M.es_ES
dc.contributor.authorRubio, Á.G.es_ES
dc.contributor.authorJaramillo, A.es_ES
dc.contributor.authorSalas, J.es_ES
dc.date.accessioned6/22/2022 13:33
dc.date.accessioned2022-09-30T15:55:59Z
dc.date.available6/22/2022 13:33
dc.date.available2022-09-30T15:55:59Z
dc.date.issued2016
dc.description.abstractThe Set Covering Problem (SCP) is a matrix that is composed of zeros and ones and consists in finding a subset of zeros and ones also, in order to obtain the maximum coverage of necessities with a minimal possible cost. In this world, it is possible to find many practical applications of this problem such as installation of emergency services, communications, bus stops, railways, airline crew scheduling, logical analysis of data or rolling production lines. SCP has been solved before with different nature inspired algorithms like fruit fly optimization algorithm. Therefore, as many other nature inspired metaheuristics which imitate the behavior of population of animals or insects, Artificial Fish Swarm Algorithm (AFSA) is not the exception. Although, it has been tested on knapsack problem before, the objective of this paper is to show the performance and test the binary version of AFSA applied to SCP, with its main steps in order to obtain good solutions. As AFSA imitates a behavior of a population, the main purpose of this algorithm is to make a simulation of the behavior of fish shoal inside water and it uses the population as points in space to represent the position of fish in the shoal. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-42085-1_13es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-42085-1_13
dc.language.isoenges_ES
dc.publisherSpringer Verlages_ES
dc.rightsinfo:eu-repo/semantics/closedAccesses_ES
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/es_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#1.02.01es_ES
dc.titleFinding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimizationes_ES
dc.typeinfo:eu-repo/semantics/articlees_ES
dc.type.versioninfo:eu-repo/semantics/publishedVersiones_ES
Archivos
Bloque original
Mostrando 1 - 1 de 1
Miniatura
Nombre:
55. Finding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization.pdf
Tamaño:
358.46 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso