Research Article
Solving a Two-Stage Stochastic Capacitated Location-Allocation Problem with an Improved PSO in Emergency Logistics
Table 8
Results of the 10 tests of different algorithms solving the classic one-stage EVM.
| | PSO | IPSO | | HIA | GC | CT | GC | CT | GC | CT | GC | CT |
| 1 | 2202 | 31.8 s | 2151 | 31.5 s | 2136 | 81.4 s | 2194 | 66 min | 2 | 2191 | 31.5 s | 2151 | 30.2 s | 2138 | 87.4 s | 2185 | 65 min | 3 | 2132 | 31.7 s | 2151 | 31.1 s | 2132 | 79.1 s | 2192 | 68 min | 4 | 2202 | 32.4 s | 2132 | 31.9 s | 2151 | 80.5 s | 2158 | 71 min | 5 | 2132 | 31.1 s | 2132 | 32.2 s | 2151 | 92.1 s | 2239 | 65 min | 6 | 2132 | 31.2 s | 2151 | 30.9 s | 2132 | 82.0 s | 2173 | 69 min | 7 | 2292 | 31.4 s | 2151 | 31.3 s | 2151 | 83.1 s | 2204 | 66 min | 8 | 2217 | 31.8 s | 2132 | 31.3 s | 2202 | 83.0 s | 2153 | 69 min | 9 | 2247 | 32.1 s | 2132 | 32.5 s | 2132 | 81.8 s | 2214 | 68 min | 10 | 2221 | 31.8 s | 2132 | 31.4 s | 2152 | 81.6 s | 2169 | 69 min |
|
|
∗ denotes the use of the simplex method.
|