Research Article
Solving Capacitated Facility Location Problem Using Lagrangian Decomposition and Volume Algorithm
Table 3
Computational results of the LD and VA for the large problems sized 1000–3000.
| | Problem size | Algorithm | LB | UB | Time | Passes | Error |
| | LD and VA | 84448.103 | 86732.678 | 1140.030 | 1550 | 2.630 | | Greedy weak | 82466.800 | 87710.265 | 1121.890 | — | 5.980 |
| | LD and VA | 101617.237 | 103125.198 | 1705.680 | 882 | 1.460 | | Greedy weak | 98770.100 | 103579.320 | 1766.210 | — | 4.640 |
| | LD and VA | 124282.603 | 126124.230 | 2429.820 | 1100 | 1.460 | | Greedy weak | — | — | — | — | — |
| | LD and VA | 161914.359 | 164486.627 | 9100.300 | 1760 | 1.564 | | Greedy weak | — | — | — | — | — |
| | LD and VA | 202179.251 | 202784.372 | 21155.3 | 1950 | 0.300 | | Greedy weak | — | — | — | — | — |
| | LD and VA | 239858.612 | 241723.867 | 38016.52 | 1993 | 0.772 | | Greedy weak | — | — | — | — | — |
|
|
