Can the Agent with Limited Information Solve Travelling Salesman Problem?

Abstract EN

Here, we develop new heuristic algorithm for solving TSP (Travelling Salesman Problem).

In our proposed algorithm, the agent cannot estimate tour lengths but detect only a few neighbor sites.

Under the circumstances, the agent occasionally ignores the NN method (choosing the nearest site from current site) and chooses the other site far from current site.

It is dependent on relative distances between the nearest site and the other site.

Our algorithm performs well in symmetric TSP and asymmetric TSP (time-dependent TSP) conditions compared with the NN algorithm using some TSP benchmark datasets from the TSPLIB.

Here, symmetric TSP means common TSP, where costs between sites are symmetric and time-homogeneous.

On the other hand, asymmetric TSP means TSP where costs between sites are time-inhomogeneous.

Furthermore, the agent exhibits critical properties in some benchmark data.

These results suggest that the agent performs adaptive travel using limited information.

Our results might be applicable to nonclairvoyant optimization problems.