Research Article
A Heuristic Algorithm for Constrained Multi-Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach
Table 1
Numerical results for Example
given in [
16].
| | Main results | VI approach | Weiszfeld-type method |
| | (2.5000, 1.9484) | (2.5000, 1.9484) | | (1.0000, 1.0000) | (1.0000, 1.0000) | | (4.0000, 1.0000) | (4.0000, 1.0000) | | (4.0000, 2.0000) | (4.0000, 2.0000) | | (2.5000, 2.0000) | (2.5000, 2.0000) | | (1.0000, 2.0000) | (1.0000, 2.0000) | | Objective value | 6.6027 | 6.6027 | | Number of iterations | 32.81/23.77 | 237.60 | | CPU | 0.0124 | 0.0610 |
|
|
“32.81/23.77” means 32.81 Iter. for initialization and 23.77 Iter. for VI approach.
|
