论文部分内容阅读
根据航天遥测、跟踪和指挥(TT&C)调度的测控需求,建立航天测控调度问题的0-1整数规划模型,运用(λ,ν)、(μ,ν)和(λ,μ)3种策略对模型中的约束进行松弛,通过次梯度优化算法求得每种松弛问题的上界。利用2个场景验证上界(目标函数值)的有效性,调度结果表明,3种松弛策略中以次梯度优化算法得到的上界差别最小。
According to the requirements of TT & C scheduling, a 0-1 integer programming model of aerospace scheduling problem is established. Three kinds of (λ, ν), (μ, ν) and The constraints in the model are relaxed and the upper bound of each relaxation problem is found by the sub-gradient optimization algorithm. The validity of the upper bound (objective function value) is verified by using two scenarios. The scheduling results show that the difference between the upper bounds of the three slack strategies by the sub-gradient optimization algorithm is the smallest.