基于拉格朗日松弛的航天测控调度上界求解算法OA北大核心CSCDCSTPCD
TT&C Scheduling Upper Bound Solution Algorithm Based on Lagrangian Relaxation
通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界.最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性.
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 op…查看全部>>
康宁;武小悦
国防科技大学信息系统与管理学院,湖南长沙410073国防科技大学信息系统与管理学院,湖南长沙410073
信息技术与安全科学
航天测控调度拉格朗日松弛拉格朗日对偶次梯度优化
TT&C scheduling lagrangian relaxation lagrangian dual subgradient optimization
《国防科技大学学报》 2011 (3)
38-43,6
国家省部资助项目
评论