Can the Agent with Limited Information Solve Travelling Salesman Problem?

Table 1

Results of the RC algorithm versus the NN, the FN, and the FN_0.5 algorithms for symmetric 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	28281	28717	39400	33831
berlin52	3	0.8	484098	487419	986569	741171
st70	3	0.9	57737	57807	118543	90676
eil76	2	0.9	50137	50579		3107821
pr76	3	0.8		11185685		16651523
rat99	5	0.9	146101	146122	422359	288554

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.