遗传算法GA

遗传算法：

旅行商问题(traveling saleman problem,简称tsp)：

已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短-GA GA GA: TSP (traveling saleman problem, short tsp): n known distance between cities, a salesman of existing cities to be visited all the n, and can only visit each city once Finally, it must return to the starting city. How to arrange his visit to the order of these cities can make the total length of the shortest travel route