Solving the set covering problem with a shuffled frog leaping algorithm
MetadataShow full item record
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. © Springer International Publishing Switzerland 2015.
Showing items related by title, author, creator and subject.
Conference PaperSoto R.; Crawford B.; Lizama S.; Johnson F.; Paredes F. (Springer Verlag, 2016)
Conference PaperCrawford B.; Soto R.; Peña C.; Riquelme-Leiva M.; Torres-Rojas C.; Johnson F.; Paredes F. (Springer Verlag, 2015)
The impact of a new formulation when solving the set covering problem using the ACO metaheuristic (2020) Crawford B.; Soto R.; Palma W.; Paredes F.; Johnson F.; Norero E. (Springer Verlag, 2015)