Study on Parameters of Self-Organizing Maps for Traveling Salesman Problem on the Earth's Surface

Abstract

The Traveling Salesman Problem (TSP) is a problem in which one must search for the shortest route that visits all cities exactly once and returns to the starting point. In this study, we investigated the properties and setting of parameters when applying the SOM method to the Traveling Salesman Problem for cities on the Earth's surface and report the results.