摘要
多星调度是一类约束条件众多且复杂的调度问题,除了要考虑时间窗、过渡时间等约束外,还需要考虑任务的时效性约束和能量消耗约束。为此,文章建立了相应的数学模型,并设计了基于圈次进行交叉、变异的遗传算法;通过STK生成测试数据,并与蚁群算法结果对比,说明该方法能有效解决多星调度问题。
Multi-satellite scheduling is a complex problem with many constraints. In addition to consider the constraints like time window and transition time, it need consider timelines and energy consumption constraints. In view of this problem, a mathematical model was established And a genetic algorithm with crossover and mutation based on circles of satellites was proposed. The proposed algorithm and the ant colony algorithm were compared through the same input test data generated by STK tools, which validated the proposed algorithm can effectively solve the multi-satellite scheduling problem.
出处
《合肥工业大学学报(自然科学版)》
CAS
北大核心
2017年第7期995-999,1008,共6页
Journal of Hefei University of Technology:Natural Science
基金
国家自然科学基金创新研究群体资助项目(71521001)
国家自然科学基金资助项目(71401048
71131002)
关键词
卫星
多星调度
遗传算法
卫星圈次
satellite
multi-satellite scheduling
genetic algorithm
satellite circles