Research Article

A Binary Cat Swarm Optimization Algorithm for the Non-Unicost Set Covering Problem

Table 4

Computational results on 65 instances of SCP: part 2.

Instance Time (s)

NRE.1 29 29 30 29.9 3.1 0.0 65.76
NRE.2 30 34 35 34.2 14.0 13.3 72.45
NRE.3 27 31 32 31.5 16.7 14.8 75.40
NRE.4 28 32 33 32.9 17.5 14.3 71.34
NRE.5 28 30 31 30.3 8.2 7.1 73.01

NRF.1 14 17 18 17.1 22.1 21.4 51.33
NRF.2 15 18 19 18.2 21.3 20.0 52.53
NRF.3 14 17 18 17.2 22.921.4 57.10
NRF.4 14 17 18 17.1 22.121.4 54.74
NRF.5 13 15 16 15.9 22.3 15.4 48.73

NRG.1 176 190 194 192.7 9.5 8.0 139.46
NRG.2 154 165 167 166 7.87.1 149.43
NRG.3 166 187 191 187.7 21.1 20.6 156.04
NRG.4 168 179 185 183.2 9.06.5141.03
NRG.5 168 181 186 184.3 9.7 7.7172.95

NRH.1 63 70 74 71.2 13.011.1 195.67
NRH.2 63 67 67 67 6.3 6.3 207.34
NRH.3 59 68 74 69.6 18.0 15.3 224.36
NRH.4 58 66 68 66.6 14.813.8214.68
NRH.5 55 61 66 61.5 11.8 10.9226.03