摘要
研究了多星多观测任务调度这一NP完全问题,建立了多星任务规划调度的混合整数规划模型,并对模型的求解进行了研究,提出运用改进的拉格朗日松弛算法来求解。仿真结果表明,改进的拉格朗日松弛算法可明显提高模型的求解效率,对大规模问题效果更为显著。
Planning and scheduling of earth observing satellites remain to be a NP-complete problem.In this paper a Mixed Integer Programming(MIP) model is proposed and the improved Lagrangian relaxation algorithm is employed to solve the model.Simulation results show that the proposed model and the improved Lagrangian relaxation algorithm are more efficient,especially for large-scale problems.
出处
《吉林大学学报（工学版）》
EI
CAS
CSCD
北大核心
2009年第2期551-554,共4页
Journal of Jilin University:Engineering and Technology Edition
基金
中科院创新工程方向性项目(062138C56S)
关键词
飞行器控制和导航技术
规划调度
混合整数模型
拉格朗日松弛算法
control and navigation technology of aerocraft
planning and scheduling
MIP model
Lagrangian relaxation algorithm
