Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (31): 17-19.
• 博士论坛 • Previous Articles Next Articles
KANG Ning,WU Xiaoyue
Received:
Revised:
Online:
Published:
康 宁,武小悦
Abstract: This paper analyzes TT&C request of TT&C scheduling problem and constructs an integer programming model of TT&C scheduling,introduces an idea of Lagrangian relaxation and combines the idea with branch and bound algorithm,designs a branch and bound algorithm based on Lagrangian relaxation to solve TT&C scheduling problem.Finally,two scenarios are tested,and obtains the optimal value of TT&C scheduling problem about the two scenarios,the results demonstrate validity of the branch and bound algorithm based on Lagrangian relaxation.
Key words: Lagrangian relaxation, TT&, C scheduling, subgradient optimization, branch and bound
摘要: 通过分析航天测控调度问题的测控需求,建立了航天测控调度整数规划模型,引入了拉格朗日松弛思想并与分枝定界算法结合,设计了基于拉格朗日松弛的分枝定界算法求解航天测控调度问题。通过对两个场景的仿真实验,得到了两个场景的航天测控调度问题最优值,验证了基于拉格朗日松弛的分枝定界算法的有效性。
关键词: 拉格朗日松弛, 航天测控调度, 次梯度优化, 分枝定界
KANG Ning,WU Xiaoyue. Branch and bound algorithm for TT&C scheduling[J]. Computer Engineering and Applications, 2011, 47(31): 17-19.
康 宁,武小悦. 航天测控调度分枝定界算法[J]. 计算机工程与应用, 2011, 47(31): 17-19.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2011/V47/I31/17