A Heuristic Algorithm for Constrained Multi-Source Location Problem with Closest Distance under Gauge: The Variational Inequality Approach

Table 4

Numerical results of location-allocation heuristic for CMLP.

𝑛	𝑚	Algorithm 9 with Initial.					Algorithm 9 without Initial.
		Iter.0	Iter.0-PC	Iter.	Iter.-PC	CPU	Iter.	Iter.-PC	CPU
100	2	2.83	73.33	1.20	289.00	0.4868	3.04	176.70	0.7018
	4	3.61	99.88	1.29	176.80	0.2652	2.65	218.47	0.4992
	6	4.55	99.05	1.53	121.75	0.1710	3.50	130.96	0.2580
	8	3.60	126.23	1.82	149.37	0.2250	3.02	170.32	0.2836
	10	3.84	138.61	2.26	257.51	0.3212	4.65	240.48	0.5118
200	2	3.24	81.22	1.24	1620.80	5.4664	3.49	1192.33	11.4596
	4	4.01	112.96	1.71	447.08	1.2932	4.37	433.10	2.5694
	6	4.65	141.10	2.23	262.97	0.7958	3.88	305.75	1.4538
	8	4.26	130.25	2.65	246.80	0.6268	4.83	287.12	1.1734
	10	4.67	171.65	2.68	281.40	0.5866	4.46	346.18	1.0232
500	2	4.03	82.35	1.63	1998.20	64.5468	4.26	1815.90	139.2036
	4	4.66	104.28	2.27	1304.48	12.3492	5.25	1445.82	26.5510
	6	5.27	133.55	2.62	727.13	5.3322	7.60	875.26	18.2956
	8	7.60	169.97	2.84	549.60	2.8050	5.24	429.83	3.8626
	10	5.42	187.95	3.47	508.13	2.3742	5.02	507.70	3.3946
1000	2	4.49	56.69	1.91	718.17	93.2321	5.63	1587.31	365.6085
	4	4.81	80.60	2.10	1376.13	46.2636	5.49	1576.85	113.8830
	6	6.84	96.75	3.43	683.35	16.1398	7.65	1344.53	57.7762
	8	7.20	161.50	3.28	563.69	9.3570	6.06	760.93	20.0896
	10	6.63	171.89	4.05	615.07	7.5880	6.47	700.53	12.9448