| 引用本文: | 康宁,武小悦.基于拉格朗日松弛的航天测控调度上界求解算法.[J].国防科技大学学报,2011,33(3):38-43.[点击复制] |
| KANG Ning,WU Xiaoyue.TT&C Scheduling Upper Bound Solution Algorithm Based on Lagrangian Relaxation[J].Journal of National University of Defense Technology,2011,33(3):38-43[点击复制] |
|
| |
|
|
| 本文已被：浏览 7053次 下载 6108次 |
| 基于拉格朗日松弛的航天测控调度上界求解算法 |
| 康宁, 武小悦 |
|
(国防科技大学 信息系统与管理学院，湖南 长沙 410073)
|
| 摘要: |
| 通过分析航天测控调度问题的测控需求，建立了航天测控调度0-1整数规划模型，运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛，运用次梯度优化算法求得了拉格朗日对偶问题的上界。最后，通过对两个场景的试验分析，证明了运用次梯度优化算法求得的上界的有效性。 |
| 关键词: 航天测控调度 拉格朗日松弛 拉格朗日对偶 次梯度优化 |
| DOI： |
| 投稿日期：2010-10-12 |
| 基金项目:国家省部资助项目 |
|
| TT&C Scheduling Upper Bound Solution Algorithm Based on Lagrangian Relaxation |
| KANG Ning, WU Xiaoyue |
|
(College of Information System and Management, National Univ. of Defense Technology, Changsha 410073, China)
|
| Abstract: |
| The TT&C demand of TT&C Scheduling problem was analyzed and a model of TT&C Scheduling 0-1 integer programming was constructed. The model's facility constraints and satellite constraints were relaxed by lagrangian relaxation method, and an upper bound of lagrangian dual problem by subgradient optimization algorithm was obtained. Finally, two examples were tested. The results demonstrate the validity of upper bound obtained by subgradient optimization algorithm. |
| Keywords: TT&C scheduling lagrangian relaxation lagrangian dual subgradient optimization |
|
|
