The TSP problem of global route planning, global drone shooting, global express industry transportation, global airline flight route design and global travel and so on all have a great influence and promotion role. In order to solve the problem of slow iteration and complicated planning route, K-means clustering algorithm and ant colony algorithm are superimposed in this paper. The longitude and latitude coordinates of 245 countries in the world are taken as points on the plane. First, all countries are gathered into 7 categories and each cluster is the base station country of this category, then the ant colony algorithm is used for each category of countries, and finally the ant colony algorithm is used for 7 base station countries. The new algorithm calculates that it requires 2645.7744 unit distances, a significant increase compared to the 126417.3819 unit distances calculated by a single colony.