Mostrar el registro sencillo del ítem

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

dc.contributor.authorCrawford B.
dc.contributor.authorSoto R.
dc.contributor.authorOlguín E.
dc.contributor.authorMisra S.
dc.contributor.authorVillablanca S.M.
dc.contributor.authorRubio Á.G.
dc.contributor.authorJaramillo A.
dc.contributor.authorSalas J.
dc.date.accessioned2020-09-02T22:15:42Z
dc.date.available2020-09-02T22:15:42Z
dc.date.issued2016
dc.identifier10.1007/978-3-319-42085-1_13
dc.identifier.citation9786, , 166-181
dc.identifier.issn03029743
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4158
dc.descriptionThe 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.
dc.language.isoen
dc.publisherSpringer Verlag
dc.sourceApduhan B.O.Murgante B.Misra S.Taniar D.Torre C.M.Rocha A.M.A.C.Wang S.Gervasi O.Stankova E.
dc.subjectArtificial Fish Swarm Optimization Algorithm
dc.subjectCombinatorial optimization
dc.subjectMetaheuristics
dc.subjectSet Covering Problem
dc.subjectAlgorithms
dc.subjectBus transportation
dc.subjectCombinatorial optimization
dc.subjectEmergency services
dc.subjectFish
dc.subjectHeuristic algorithms
dc.subjectRailroad transportation
dc.subjectAirline crew scheduling
dc.subjectArtificial fish swarm algorithms
dc.subjectArtificial fish swarm optimization algorithm
dc.subjectKnapsack problems
dc.subjectLogical analysis of data
dc.subjectMeta heuristics
dc.subjectNature inspired algorithms
dc.subjectSet covering problem
dc.subjectOptimization
dc.titleFinding solutions of the set covering problem with an Artificial Fish Swarm Algorithm Optimization
dc.typeConference Paper


Ficheros en el ítem

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

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

Mostrar el registro sencillo del ítem