TSP Algorithm Based on Working Set of Convex Hull

The TSP problem is NP-complete problems fully applied in many areas of real life. By analyzing computational geometry Sin the convex hull algorithm,we propose that a maximum convex hull for planning TSP path algorithm can quickly resolve the two-dimensional TSP problem. Firstly,we use convex hull algorithm to construct the largest convex hull of the city set,with the node to the remaining cities according to the size of the membership of the urban nodes added to the convex hull of set. Then,the convex hull of concentrated urban node one by one division in accordance with the maximum convex hull algorithm until the work has focused on the scale. Finally,the sub working sets are visited one by one to ensure the correctness of the TSP algorithm. The experimental results show that the algorithm bionic intelligent algorithm can more quickly get the approximate solution of the problem.