TSP问题,容易懂的遗传算法(国外英文资料).doc

TSP问题,容易懂的遗传算法(国外英文资料) A genetic algorithm for solving TSP problem Abstract: genetic algorithm is a new global optimization search algorithm which simulates biological evolution process, this paper. Single genetic algorithm is introduced, and the application of the standard genetic algorithm to solve the problem of travel bag. Keywords: genetic algorithm, travel bag problem A description of the problem, travel bag: The traveling salesman problem, namely TSP (Traveling Saleman Problem) is a field of Mathematics A famous problem, also known as the traveling salesman problem, simply described as a traveling salesman to visit n city (1, 2,... , n), he must choose which path to go, visit each city only once, and finally back To the starting city, which take the shortest path. The description is the earliest 1759 study of Euler The knight tour problem, for 64, the international chess board, visited 64 square once and most The final return to the starting point. Using graph theory explained as having a graph G= (V, E), where V is the vertex set and edge set E, D= (D Ij) is composed of the distance matrix between vertex i and vertex J distance, the traveling salesman problem is obtained A through all the vertices and every vertex only by one with the shortest distance loop. If for The city of V={v1, V2, V3,..., an access sequence for T= vn} (T1, T2, t3,... Ti,... , TN Ti V (i=1), among them, 2, 3,... N, T1, and tn+1=), the mathematical model is the traveling salesman problem : Min L= sigma D (t (I), t (i+1) (i=1),... N). The traveling salesman problem is a typical combinatorial optimization problem is a NP hard problem, its possible The number of paths is (n-1)! With the increase of the number of city, the number of paths to increase sharply, with the small size of the trip Business problems, it can get the optimal path by exhaustive method, but for the large traveling salesman problem, it is difficult to Calculated by exhaustive method. In the life of TSP has been widely u