论文部分内容阅读
成像侦察卫星任务规划问题是一类典型多约束组合优化问题.最小化全局完成时间是任务规划领域时效性要求较高情况下的一种优化目标.提出一种整合整数规划与约束规划方法,在最小化任务规划方案全局完成时间的目标下,求解成像侦察卫星任务规划问题的组合算法.该算法通过应用Benders分解将原约束整数规划模型划分为主问题与子问题两部分,采用软件MOSEK与GECODE对主、子问题分别求解.根据子问题求解结果生成剪枝约束,返回主问题迭代,直到获得优化解.算法有效性通过仿真实验进行了检验并取得预期效果.
The task of imaging reconnaissance satellite mission planning is a typical multi-constrained combinatorial optimization problem, and minimizing the global completion time is an optimization objective under the high timeliness requirements in the field of mission planning. An integrated integer programming and constrained programming method Aiming to solve the problem of mission planning in imaging reconnaissance satellites under the goal of minimizing the global completion time of mission planning scheme.This algorithm divides the original constrained integer programming model into the main problem and the subproblem by using Benders decomposition.The software MOSEK and GECODE Solve the main and sub-problems respectively, and generate the pruning constraints according to the sub-problems and return to the iteration of the main problem until the optimal solution is obtained.The validity of the algorithm is verified through simulation experiments and the expected results are obtained.