旅行商问题可描述为：商品的推销员打算从驻地出发遍访他要去的每个城市，并且每个城市只能访问一次，最后必须返回出发城市。问如何安排他对这些城市的访问次序,可使其旅行路线的总长度最短？用图论的术语来说，旅行商问题就是在赋权完全图上找一个权最小的Hamilotn圈[4]。-Traveling salesman problem can be described as: the salesman intends to start　the station to visit each city he wants to go, and each city can only visit once, and finally must return to the starting city. Ask how to arrange his visit to these cities order, can make the total length of the travel route is the shortest? In terms of graph theory, the traveling salesman problem is to find a weighted complete graph on the smallest Hamilotn circle [4].