摘要
多地面站数传规划问题是一个复杂的组合优化问题,目前的研究大都假设各个数据下传任务没有优先级,或优先级固定。考虑数据下传任务优先级动态变化特性,建立了冲突时段约束图模型,提出了基于遗传算法的多地面站数传规划算法。根据模拟的数据进行实验及分析,表明该方法能有效解决多地面站数传规划问题。
The multi-ground stations scheduling problem is a complex combinatorial optimization problem. Current researches mainly deal with this problem on the assumption that the data-download missions have no priority or fixed priority. With the characteristic of flexible priority of data-download missions, the conflict section constraint graph model is established and an algorithm based on genetic algorithm is proposed. Finally, some experiments are implemented to valid the correctness and practicability of the proposed algorithm.
出处
《系统工程与电子技术》
EI
CSCD
北大核心
2009年第7期1655-1660,共6页
Systems Engineering and Electronics
基金
国家自然科学基金(60604035)
国家高技术研究发展计划(863计划)(2007AA12Z229)
国家科技支撑计划(2006BAG01A07)资助课题
关键词
数传规划问题
冲突时段约束图
遗传算法
data download mission scheduling problem
conflict section constraint graph
genetic algorithm
