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

Table 9

Optimal objective function values of two algorithms (CNY).

Instance name	Algorithm	Mean	Std. dev.	C.V.	value	Significance test; value (sig. 1-tailed)
Perl 183-	ACO	711347.1	6979.11	0.0098	1.6838	0.048
	HACO	709237.9	5454.48	0.0077
Gaskell 67-	ACO	31929818.3	627210.66	0.0196	1.7118	0.045
	HACO	31718084.1	609606.04	0.0192
Gaskell 67-	ACO	3288921.3	43585.25	0.0133	1.6602	0.050
	HACO	3275052	39868.81	0.0122
Perl 183-	ACO	285145.3	3779.15	0.0133	1.8391	0.034
	HACO	283831.6	3351.00	0.0118
Christofides 69-	ACO	419695.8	4948.15	0.0118	2.5020	0.007
	HACO	417298.6	4627.32	0.0111
Perl 183-	ACO	486011.0	4503.39	0.0093	1.8080	0.037
	HACO	484424.1	4270.44	0.0088
Christofides 69-	ACO	458235.6	6387.00	0.0139	1.6796	0.048
	HACO	456441.6	5317.70	0.0117