The Application of Natural Computation for Solving the Traveling Salesman Problems
Huowen Jiang, Huanliang Xiong, Huiyun Zhang · 2015
Traveling Salesman Problems is a classical kind of combined optimization problems.Solving TSP effectively can produce very important theoretical value in computable theory, and also has very high applied value in practice.Solving travel salesman problems by using some traditional algorithms is limited, The article discuss several natural computation methods of solving travel salesman problems, including solution of genetic algorithm, solution of continuous Hopfield algorithm and solution of Ant colony optimization algorithm.