基于禁忌搜索算法测地卫星任务调度研究  

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

作　　者：左春荣[1,2] 王海燕[1,2] 

机构地区：[1]合肥工业大学计算机网络系统研究所,合肥230009 [2]过程优化与智能决策教育部重点实验室,合肥230009

出　　处：《计算机工程与应用》2010年第1期215-217,245,共4页Computer Engineering and Applications

基　　金：国家自然科学基金No.70471046~~

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

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

分 类 号：TP391[自动化与计算机技术—计算机应用技术]