Research Article
Adaptive Black Hole Algorithm for Solving the Set Covering Problem
Table 9
Sampling phase: hardest instances for groups 4, 5, 6, A, and B.
| Hardest instances | Transfer functions | Discretization methods | ID | Optimum values | Standard | Complement | Static probability | Elitist |
| 4.10 | 514 | | 515 | 514 | 516 | 515 | | 516 | 515 | 515 | 517 | | 516 | 516 | 517 | 514 | | 515 | 515 | 515 | 514 | | 515 | 516 | 517 | 516 | | 514 | 517 | 515 | 515 | | 516 | 517 | 516 | 515 | | 514 | 515 | 516 | 515 |
| 5.10 | 265 | | 265 | 267 | 266 | 266 | | 265 | 267 | 266 | 266 | | 266 | 266 | 265 | 265 | | 265 | 266 | 265 | 265 | | 265 | 267 | 265 | 268 | | 265 | 265 | 267 | 268 | | 265 | 268 | 265 | 266 | | 265 | 267 | 267 | 266 |
| 6.5 | 161 | | 164 | 163 | 162 | 162 | | 162 | 163 | 163 | 164 | | 162 | 163 | 161 | 164 | | 164 | 161 | 162 | 163 | | 161 | 164 | 163 | 161 | | 161 | 162 | 163 | 163 | | 162 | 163 | 161 | 163 | | 162 | 162 | 161 | 163 |
| A.5 | 236 | | 239 | 238 | 239 | 238 | | 238 | 236 | 238 | 237 | | 239 | 237 | 237 | 237 | | 236 | 238 | 236 | 237 | | 239 | 236 | 237 | 239 | | 236 | 239 | 237 | 238 | | 236 | 237 | 239 | 237 | | 238 | 239 | 239 | 237 |
|
|