基于解构造图的卫星数传调度ACO算法  

ACO algorithm of satellite data transmission scheduling based on solution construction graph

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

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

出　　处：《系统工程与电子技术》2010年第3期592-597,共6页Systems Engineering and Electronics

摘　　要：针对卫星数传调度问题,建立了基于任务调度关系(弧模式)和基于任务调度位置(结点模式)的解构造图,提出了基于解构造图的卫星数传调度蚁群优化(ant colony optimization,ACO)算法。算法利用伪随机概率转移规则进行路径搜索,通过划分冲突任务集来限制蚁群的搜索邻域。算法根据迭代最优解和至今最优解进行全局信息素更新,并将构造图中的信息素浓度限制在一定范围内。仿真结果表明,文中提出的两种解构造图及ACO算法是正确可行的,基于结点模式解构造图的ACO算法能获得更优的解。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.

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

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] V57[自动化与计算机技术—计算机科学与技术]