Abstract
In this paper we design and evaluate a shuffled frog leaping algorithm that solves the set covering problem. The shuffled frog leaping algorithm is a novel metaheuristic inspired by natural memetics. It consists of an individual memetic evolution and a global memetic information exchange between a population of virtual frogs representing possible solutions of a problem at hand. The experimental results show the effectiveness of our approach which produces competitive results solving a portfolio of set covering problems from the OR-Library.
Author supplied keywords
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Cite
CITATION STYLE
Crawford, B., Soto, R., Peña, C., Palma, W., Johnson, F., & Paredes, F. (2015). Solving the set covering problem with a shuffled frog leaping algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9012, pp. 41–50). Springer Verlag. https://doi.org/10.1007/978-3-319-15705-4_5
Readers' Seniority
Readers' Discipline
