Research on solving tsp problem by intelligent optimization algorithm

Requirements:

The TSP algorithm (traveling salesman problem) refers to the distance between a given n cities and cities, to

To determine the shortest path that passes through each city when and only once, it is a typical optimization problem, its optimal

The solution cost refers to a number of levels. The TSP problem represents a kind of optimization problem, which has many applications in the actual project, such as

Computer networking, electronic map, traffic guidance, etc., have important research value. Both the genetic algorithm and the Tabu search algorithm are

is an intelligent optimization algorithm with global optimization performance and strong versatility. This algorithm generally has a rigorous theoretical basis,

In theory, the optimal solution or approximate optimal solution can be found in a certain time, which is widely used in computer science optimization scheduling problem,

Combinatorial optimization issues. By reading books and scientific literature, we study the basic principles of genetic algorithms or Tabu search algorithms,

Research TSP problem and propose common solution. On this basis, the programming implementation of intelligent optimization algorithm to solve the TSP

Problems, and the corresponding experimental results and algorithm analysis are given.

Research on solving tsp problem by intelligent optimization algorithm