Name
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. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-15705-4_5 | INTELLIGENT INFORMATION AND DATABASE SYSTEMS, PT II |
Keywords | Field | DocType |
Shuffled frog leaping algorithm, Set covering problem, Metaheuristics, Artificial and computational intelligence | Set cover problem,Population,Mathematical optimization,Computer science,Information exchange,Memetics,Shuffled frog leaping algorithm,Covering problems,Metaheuristic | Conference |
Volume | ISSN | Citations |
9012 | 0302-9743 | 8 |
PageRank | References | Authors |
0.53 | 13 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Broderick Crawford | 1 | 446 | 73.74 |
| Ricardo Soto | 2 | 194 | 47.59 |
| Cristian Peña | 3 | 20 | 2.10 |
| Wenceslao Palma | 4 | 68 | 5.92 |
| Franklin Johnson | 5 | 38 | 4.72 |
| Fernando Paredes | 6 | 230 | 27.21 |