Computer Engineering and Applications ›› 2010, Vol. 46 ›› Issue (1): 215-217.DOI: 10.3778/j.issn.1002-8331.2010.01.064

• 工程与应用 • Previous Articles     Next Articles

Research on scheduling of earth observing satellites based on taboo search algorithm

ZUO Chun-rong1,2,WANG Hai-yan1,2   

  1. 1.Computer Network System Institute,Hefei University of Technology,Hefei 230009,China
    2.Key Laboratory of Process Optimization and Intelligent Decision-making,Ministry of Education,Hefei 230009,China
  • Received:2008-07-21 Revised:2008-10-23 Online:2010-01-01 Published:2010-01-01
  • Contact: ZUO Chun-rong



  1. 1.合肥工业大学 计算机网络系统研究所,合肥 230009
    2.过程优化与智能决策教育部重点实验室,合肥 230009
  • 通讯作者: 左春荣

Abstract: The problem of scheduling of earth observing satellites is addressed.This scheduling task is a difficult optimization problem,involving multiple satellites,hundreds of tasks,constraints on when and how to service each task.This paper analyzes the main constraints of this problem,constructs a multi-resources scheduling model with time window under some reasonable assumption and gives an improved taboo search algorithm to solve the model.An example is given to validate the model and algorithm.And the solution is analyzed comparatively with that of dynamic planning method on this problem.

Key words: scheduling, taboo search, simulation, earth observing satellites

摘要: 研究测地卫星调度问题,它是一个复杂的组合优化问题,涉及多个卫星,大量的任务与约束限制,何时和如何执行每项任务。分析了问题的主要约束,在合理的假设基础上建立了带有时间窗口多资源调度问题模型,提出一种改进的禁忌搜索算法求解该模型。用实例对模型和算法进行了验证,并将结果与动态规划方法求解结果比较分析,结果表明模型和算法是有效的。

关键词: 调度, 禁忌搜索, 仿真, 测地卫星

CLC Number: