Research Article
Can the Agent with Limited Information Solve Travelling Salesman Problem?
Table 2
Results of the RC algorithm versus the NN, the FN, and the FN0.5 algorithms for asymmetric TSP.
| ||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
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. |