摘要

For satellite data transmission scheduling problems (SDTSP), two types of solution construction graphs based on task scheduling relation (arc model) and task scheduling position (node model) are founded, an ant colony optimization (ACO) algorithm of SDTSP based on solution construction graphs is proposed. The algorithm searches a path by making use of the pseudorandom proportional probability transfer rule and restricts searching the neighborhood through plotting out conflict task sets. The algorithm processes global pheromone updating based on the best iterative solution and best-so-far solution, and the consistency of pheromone in graph is restricted within a certain range. Simulation result shows that these two solution construction graphs and the ACO algorithm are feasible, and the ACO algorithm featuring a solution construction graph based on the node model can gain a preferable solution.

  • 出版日期2010

全文