蚁群算法在卫星数传调度问题中的应用  

Ant colony algorithm for satellite data transmission scheduling problem

作　　者：陈祥国[1] 武小悦[1] 

机构地区：[1]国防科学技术大学信息系统与管理学院,湖南长沙410073

出　　处：《系统工程学报》2009年第4期451-456,488,共7页Journal of Systems Engineering

摘　　要：为求解卫星数传调度问题,将数传任务在调度序列中的可能位置抽象为结点,构造了信息素分布于结点的矩阵解构造图,提出了基于该图的蚁群算法.算法通过随机转移概率决策模型进行结点转移,在算法迭代中利用精英保留策略进行全局信息素更新.仿真结果表明,基于矩阵解构造图的蚁群算法是求解卫星数传调度问题的有效方法,并具有较好的收敛性和鲁棒性.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.

关 键 词：蚁群算法 解构造图 卫星数传 任务调度 

分 类 号：P301.6[天文地球—地球物理学] V57[航空宇航科学与技术—航空宇航推进理论与工程]