Satellite-ground Station Routing Algorithm Based on Improved Ant Colony Optimization-Tabu Search

At present, with the rapid development of satellite communication, people have paid more attention to the satellite-ground station routing algorithm. Ant colony optimization (ACO) has good robustness. But it is not easy to obtain the optimal solution. We propose an Improved Ant Colony Optimization-Tabu Search Satellite-ground station Routing (IACO-TSSGR) algorithm. The simulation results show that, after convergence, it has better performance than ACO. After the algorithm convergence, its pathfinding failure rate is 0%, while ACO's pathfinding failure rate is still 8%. So, it can achieve more efficient global search. Under the same number of iterations, compared with ACO, it reduces the average link consumption by 43%, the max link consumption by 58% and the convergence time by 8.2%.