Can the Agent with Limited Information Solve Travelling Salesman Problem?

Table 2

Results of the RC algorithm versus the NN, the FN, and the FN_0.5 algorithms for asymmetric TSP.

	n	Ratio	RC	NN	FN	FN0.5	<p value versus NN	<p value versus FN	<p value versus FN0.5
eil51	2	0.9	889603	913611	1285875	1088586
berlin52	3	0.8	16503376	16951505	36531058	26972814
st70	3	0.9	2396821	2404644	5392320	4079429
eil76	2	0.9	2312813	2350991		3107821
pr76	2	0.9		587621582
rat99	5	0.9	8163898	8167380	27811823	18415728

First column indicates benchmarks. The parameter n indicates the number of n-neighbors. The parameter ratio determines the similarity between travel distances to the nearest site and to the farthest site among n-neighbors. Further, average summations of total cost from each agent in respective algorithms are shown. Further, note that bold p values indicate that the RC performs better than control algorithms under Mann–Whitney U test.