摘要
通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的设备约束和卫星约束进行了松弛,运用次梯度优化算法求得了拉格朗日对偶问题的上界。最后,通过对两个场景的试验分析,证明了运用次梯度优化算法求得的上界的有效性。
The TI＆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 subgradiem optimization algorithm was obtained. Finally, two examples were tested. The results demonstrate the validity of upper bound obtained by subgmdient optimization algorithm.
出处
《国防科技大学学报》
EI
CAS
CSCD
北大核心
2011年第3期38-43,共6页
Journal of National University of Defense Technology
基金
国家省部资助项目
