A Comparative Performance Analysis of Computational Intelligence Techniques to Solve the Asymmetric Travelling Salesman Problem

Table 2

Comparative experimental results of metaheuristics on ATSP.

MIMM-ACO			MMAS		IEO		CGAS		ABO
TSP case	Rel. err %	CPU time (s)	Rel. err %	CPU time (s)	Rel. err %	CPU time (s)	Rel. err %	CPU time (s)	Rel. err %	CPU time (s)
Br17	0	0.01	0	0.0	0	0.01	0	0.01	0	0.028
ft53	0	3.53	0.22	3	0	3.85	0.35	6.78	0	0.028
ftv33	0	6.12	0	10	0	4.78	0	28.73	0.08	0.029
ftv35	0	5.35	0	15	0	7.35	0	21.35	0.07	0.030
ftv38	0	8.64	0	11	0	7.83	0	29.79	0	0.026
ftv44	0	9.37	0	12	0	8.21	0	37.63	0.06	0.032
ftv47	0	7.52	0	10	0	9.37	0	29.7	0.06	0.029
ftv55	0	6.38	0	19	0	5.06	0	18.41	0.12	0.029
ftv64	0	15.37	0	28	0	16.42	0	29.25	0.0	0.041
p43	0	8.35	0.08	9	0.13	5.47	0	7.53	0.44	0.065
ry48p	0	7.83	0	8	0	5.45	0	12.35	0.12	0.037
rgb323	0	0.01	1.3	97	0.06	87.12	0.13	103.28	0	2.050
rgb358	0	0.01	0.75	75	0	69.65	0.35	96.49	0.18	3.043
rgb403	0	0.01	1.35	104.39	0	85.32	0.31	147.83	0.08	4.741
rgb443	0	0.01	1.73	91	0	76.14	0	143.76	0.11	10.37
Mean	0	15.5	0.36	32.83	0.013	26.14	0.08	52.02	0.09	1.37
Total	0	78.51	5.43	492.39	0.19	392.03	1.24	780.22	1.4	20.58

Rel. err = relative error; CPU time = total time taken by the algorithm to obtain result; s = seconds.