Solving a Closed-Loop Location-Inventory-Routing Problem with Mixed Quality Defects Returns in E-Commerce by Hybrid Ant Colony Optimization Algorithm

Table 10

Iterations of two algorithms (times).

Instance name	Algorithm	Mean	Std. dev.	C.V.	value	Significance test; value (sig. 1-tailed)
Perl 183-	ACO	193.32	78.70	0.4071	0.6323	0.264
	HACO	183.90	70.04	0.3808
Gaskell 67-	ACO	191.34	86.36	0.4513	0.7831	0.218
	HACO	180.70	43.32	0.2397
Gaskell 67-	ACO	254.44	76.84	0.3020	0.2012	0.421
	HACO	251.84	49.42	0.1962
Perl 183-	ACO	241.74	77.29	0.3197	0.1000	0.460
	HACO	240.46	47.33	0.1968
Christofides 69-	ACO	245.24	79.10	0.3226	1.2340	0.110
	HACO	229.92	62.30	0.2710
Perl 183-	ACO	247.18	94.89	0.3839	0.4355	0.332
	HACO	240.80	65.75	0.2730
Christofides 69-	ACO	248.06	97.18	0.3918	0.2627	0.397
	HACO	244.08	65.48	0.2681