遗传算法解决TSP问题

已知n个城市之间的相互距离，现有一个推销员必须遍访这n个城市，并且每个城市只能访问一次，最后又必须返回出发城市。如何安排他对这些城市的访问次序，可使其旅行路线的总长度最短？-genetic algorithm known TSP n cities between the distance, must present a salesman traveled this n cities, and each city can only be visited once, Lastly, it also must return to the starting city. How to arrange for him to visit these cities priorities, it can travel routes of the total length of the shortest?