Research on solving Traveling Salesman Problem based on virtual instrument technology and genetic-annealing algorithms

摘要

TSP (Travelling Salesman Problem) is a typical issue of combinatorial optimization problem in the domain of mathematics, which aims at finding the shortest pathway among the given cities, and visit each city only once. This essay introduces an efficient way to solve TSP based on virtual instrument technology, combining the genetic algorithm and annealing algorithm. Because it takes the advantage of global and local optimization of the two algorithms. Finally, this paper proves that using the genetic algorithm result as the initial condition of the annealing algorithm method is a better way to obtain the best pathway. The visible result displays and testes the validity of this method.