Abstract
The 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.
Author supplied keywords
Cite
CITATION STYLE
Crawford, B., Soto, R., Olguín, E., Villablanca, S. M., Rubio, Á. G., Jaramillo, A., & Salas, J. (2016). An artificial fish swarm optimization algorithm to solve set covering problem. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9799, pp. 892–903). Springer Verlag. https://doi.org/10.1007/978-3-319-42007-3_76
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
