Name
Title | ||
|---|---|---|
Binarization Methods for Shuffled Frog Leaping Algorithms That Solve Set Covering Problems |
Abstract | ||
|---|---|---|
This work proposes Shuffled Frog Leaping Algorithms (SFLAs) to solve Set Covering Problems (SCPs). The proposed algorithms include eight transfer function and five discretization methods in order to solve the binary representation of SCP. Different instances of the Set Covering Problem are solved to test our algorithm showing very promising results. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1007/978-3-319-18473-9_31 | SOFTWARE ENGINEERING IN INTELLIGENT SYSTEMS (CSOC2015), VOL 3 |
Keywords | Field | DocType |
Shuffled Frog Leaping Algorithm,Set Covering Problem,Metaheuristics,Combinatiorial Optimization | Discretization,Set cover problem,Algorithm,Transfer function,Shuffled frog leaping algorithm,Mathematics,Covering problems,Metaheuristic,Binary number | Conference |
Volume | ISSN | Citations |
349 | 2194-5357 | 5 |
PageRank | References | Authors |
0.41 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Broderick Crawford | 1 | 446 | 73.74 |
| Ricardo Soto | 2 | 194 | 47.59 |
| Cristian Peña | 3 | 20 | 2.10 |
| Marco Riquelme-Leiva | 4 | 12 | 1.57 |
| Claudio Torres-Rojas | 5 | 12 | 1.57 |
| Franklin Johnson | 6 | 18 | 5.76 |
| Fernando Paredes | 7 | 230 | 27.21 |