火力与指挥控制2012，Vol.37Issue(8)：104-107,4.
航天测控调度问题的拉格朗日启发式算法
Lagrangian Heuristic Algorithm for TT&C Scheduling Proplem
康宁 1武小悦 1张国亭2
作者信息
- 1. 国防科技大学信息系统与管理学院,长沙 410073
- 2. 北京跟踪与通信技术研究所,北京 100094
- 折叠
摘要
Abstract
Tracking Telemetry and Command (TT&.C) demand of TT&C Scheduling problem is analyzed and a model of TT&C Scheduling 0-1 integer programming is constructed. The model's task constraints and facility constraints are relaxed by lagrangian relaxation method, and obtained an upper bound of TT&.C Scheduling problem by subgradient optimization algorithm. At the same time, lagrangian weight of decision variant is obtained, as heuristic information about whether the decision variant to be scheduled in optimal solution, the lagrangian weight to be analyzed, and proposed a lagrangian heuristic to obtain a feasible solution of TT&C Scheduling problem. Finally, two examples are tested, the results demonstrate validity of feasible solution obtained by lagrangian heuristic.关键词
航天测控调度/拉格朗日松弛/次梯度优化/拉格朗日启发式Key words
TT&C scheduling,lagrangian relaxation,subgradient optimization,lagrangian heuristic
分类
信息技术与安全科学引用本文复制引用
康宁,武小悦,张国亭..航天测控调度问题的拉格朗日启发式算法[J].火力与指挥控制,2012,37(8):104-107,4.
