Integration schedule of agile satellite is a highly complex combinatorial optimization problem. Pointed at the long time-window brought by the three degrees of freedom of agile satellite, combined with the dynamic store capacity in the integration schedule, a mixed integer program model is built. Then an improved ant colony algorithm is proposed to solve this problem. And local search mechanism is introduced to speed up the convergence of ant colony algorithm. Finally, multiple instances are tested. The result shows that the proposed improved ant colony algorithm is effective in solving the integration schedule of agility satellite.
展开▼
