Abstract: Compare with the essential of Traveling Salesman Problem (TSP) and Link Enhancement Problem. We present a solution for Link Enhancement Problem based on ant algorithm. To deal with the restriction condition, we propose two different kinds of strategies. By the simulation experiment, the algorithm is proved to be feasible. With the result of simulation experiment, we analyze the enactment of the parameters, and compare the performance of the two strategies.