Ant colony algorithm for satellite data transmission scheduling problem

For solving satellite data transmission scheduling problem(SDTSP),the potential positions of data transmission tasks in scheduling sequence are regarded as nodes,a matrix solution construction graph whose nodes carry the pheromones nodes is constructed,and an ant colony algorithm based on the graph is proposed.The algorithm carries out transferring in nodes through a random transfer probabilistic decision model,and makes use of elite reservation strategy for updating global pheromone in iteration.The simulation result shows that the algorithm is effective for SDTSP,and possesses better convergence and robustness.