[3J4-J-1] Fundamental AI, theory: search and application

[3J4-J-1-02] An Algorithm for solving the Traveling Salesman Problem using Clustering Method

〇Jumpei Uchida¹, Hajime Anada¹ (1. Tokyo City University)

Keywords:Traveling Salesman Problem, clustering

Many economic and industrial problems lead to combinatorial optimization problems. Of these combinatorial optimization problems, the traveling salesman problem (TSP) is one of the most important problem in the field of technology and science.Therefore, we construct a new algorithm for the TSP using a new clustering method.