Research Article
A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem
Table 2
Computation times of BCSO and ABC.
| | Instance set | Number of instances | Timeavg BCSO (s) | Timeavg ABC (s) |
| | 4 | 10 | 4.5 | 5.1 | | 5 | 10 | 5.6 | 6.6 | | 6 | 5 | 7.0 | 11.0 | | A | 5 | 11.7 | 11.2 | | B | 5 | 25.8 | 37.9 | | C | 5 | 20.0 | 17.7 | | D | 5 | 49.4 | 72.2 | | NRE | 5 | 71.6 | 96.6 | | NRF | 5 | 52.9 | 314.2 | | NRG | 5 | 151.8 | 94.8 | | NRH | 5 | 213.4 | 545.7 |
|
|
