| 航天测控调度问题的拉格朗日启发式算法 |
| |
| 引用本文： | 康宁,武小悦,张国亭.航天测控调度问题的拉格朗日启发式算法[J].火力与指挥控制,2012,37(8):104-107. |
| |
| 作者姓名： | 康宁 武小悦 张国亭 |
| |
| 作者单位： | 1. 国防科技大学信息系统与管理学院,长沙,410073
2. 北京跟踪与通信技术研究所,北京,100094 |
| |
| 摘 要： | 通过分析航天测控调度问题的测控需求,建立了航天测控调度0-1整数规划模型,运用拉格朗日松弛方法对模型中的任务约束和设备约束进行了松弛,运用次梯度优化算法求得了航天测控调度问题上界,同时得到了决策变量对应的拉格朗日权重,可以作为决策变量在最优解中是否被调度的启发式信息,对拉格朗日权重进行分析,提出了求解问题可行解的拉格朗日启发式算法。最后,通过对两个场景的试验分析验证了拉格朗日启发式算法所求可行解的优越性。
|
| 关 键 词： | 航天测控调度 拉格朗日松弛 次梯度优化 拉格朗日启发式 |
Lagrangian Heuristic Algorithm for TT&C Scheduling Proplem |
| |
| KANG Ning
,
WU Xiao-yue
,
ZHANG Guo-ting.Lagrangian Heuristic Algorithm for TT&C Scheduling Proplem[J].Fire Control & Command Control,2012,37(8):104-107. |
| |
| Authors: | KANG Ning WU Xiao-yue ZHANG Guo-ting |
| |
| Institution: | 1.College of Information Systems and Management,National University of Defense Technology,Changsha 410073,China,2.Beijing Institute of Tracking and Telecommunications Technology,Beijing 100094,China) |
| |
| 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. |
| |
| Keywords: | TT&C scheduling lagrangian relaxation subgradient optimization lagrangian heuristic |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
