| 卫星任务调度问题的约束规划模型 |
| |
| 引用本文： | 陈英武,方炎申,李菊芳,贺仁杰. 卫星任务调度问题的约束规划模型[J]. 国防科技大学学报, 2006, 28(5): 126-132 |
| |
| 作者姓名： | 陈英武 方炎申 李菊芳 贺仁杰 |
| |
| 作者单位： | 国防科技大学,信息系统与管理学院,湖南,长沙,410073;国防科技大学,信息系统与管理学院,湖南,长沙,410073;国防科技大学,信息系统与管理学院,湖南,长沙,410073;国防科技大学,信息系统与管理学院,湖南,长沙,410073 |
| |
| 基金项目： | 高校博士学科点专项科研基金(20049998022)，国家部委资助项目 |
| |
| 摘 要： | 卫星任务规划与调度是空间资源管理的重要内容之一,其目的在于为卫星系统的任务计划编制提供科学合理的决策手段与依据。卫星任务调度问题的重要特点在于,调度任务存在可见时间窗口约束。只有在可见时间窗口内,调度任务才可能执行并完成。在进行合理假设的基础上,建立卫星任务调度问题的约束规划模型。对基本禁忌搜索算法进行改进,提出了模型求解的变邻域禁忌搜索算法。应用结果表明,约束规划模型的建立与求解是合理的。
|
| 关 键 词： | 卫星 任务调度 约束满足问题 约束规划 变邻域禁忌搜索算法 |
| 文章编号： | 1001-2486(2006)05-0126-07 |
| 收稿时间： | 2006-04-10 |
| 修稿时间： | 2006-04-10 |
Constraint Programming Model of Satellite Mission Scheduling |
| |
| CHEN Yingwu,FANG Yanshen,LI Jufang and HE Renjie. Constraint Programming Model of Satellite Mission Scheduling[J]. Journal of National University of Defense Technology, 2006, 28(5): 126-132 |
| |
| Authors: | CHEN Yingwu FANG Yanshen LI Jufang HE Renjie |
| |
| Affiliation: | College of Information System and Management, National Univ. of Defense Technology, Changsha 410073, China;College of Information System and Management, National Univ. of Defense Technology, Changsha 410073, China;College of Information System and Management, National Univ. of Defense Technology, Changsha 410073, China;College of Information System and Management, National Univ. of Defense Technology, Changsha 410073, China |
| |
| Abstract: | Mission planning and scheduling of satellite,which is to support task plan making of satellite scientifically,is a main content of space resource management.One of the most important characteristics of satellite mission scheduling is that it is subject to time windows constraint,which means that tasks can only be completed within the given time windows.The scheduling model is formulated based on reasonable assumptions and constraint programming method.The model is solved with Variable Neighborhood Tabu Search(VNTS) algorithm.On the basis of a limited experiment,we observe that the algorithm is very effective in obtaining near-optimal solutions. |
| |
| Keywords: | satellite mission scheduling CSP(constraint satisfaction problem) CP(constraint programming) VNTS(variable neighborhood tabu search) algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《国防科技大学学报》浏览原始摘要信息 |
|
点击此处可从《国防科技大学学报》下载免费的PDF全文 |
|
