An artificial fish swarm optimization algorithm to solve set covering problem

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.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 14:20
dc.date.accessioned2022-06-22T19:51:08Z
dc.date.available6/22/2022 14:20
dc.date.available2022-06-22T19:51:08Z
dc.date.issued2016
dc.description.abstractThe Set Covering Problem (SCP) consists in finding a set of solutions that allow to cover a set of necessities with the minor possible cost. There are many applications of this problem such as rolling production lines or installation of certain services like hospitals. SCP has been solved before with different algorithms like genetic algorithm, cultural algorithm or firefly algorithm among others. The objective of this paper is to show the performance of an Artificial Fish Swarm Algorithm (AFSA) in order to solve SCP. This algorithm, simulates the behavior of a fish shoal inside water and it uses a population of points in space to represent the position of a fish in the shoal. Here we show a study of its simplified version of AFSA in a binary domain with its modifications applied to SCP. This method was tested on SCP benchmark instances from OR-Library website. © Springer International Publishing Switzerland 2016.es_ES
dc.formatapplication/pdfes_ES
dc.identifier.doi10.1007/978-3-319-42007-3_76es_ES
dc.identifier.urihttps://doi.org/10.1007/978-3-319-42007-3_76
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.titleAn artificial fish swarm optimization algorithm to solve 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:
24. An artificial fish swarm optimization algorithm to solve set covering problem.pdf
Tamaño:
208.83 KB
Formato:
Adobe Portable Document Format
Descargar
Colecciones
Ponencia de congreso