自己組織化マップ(SOM)による地球表面上の巡回セールスマン問題の解法

抄録

Traveling Salesman Problem (TSP) is a problem of finding the shortest route back to the starting point after visiting each city only once. It is called an NP-complete problem, and many computational methods have been proposed. Referring previous Self-Organizing Maps (SOM) research, we have studied how to shorten the computation time for applying SOM to the TSP while keeping the original form. In this study, we applied and examined the problem of traveling cities on the earth.