求解成像卫星调度问题的改进蚁群算法

The Improved Ant Colony Algorithm Solving the Scheduling Problem of Imaging Satellites

蚁群算法求解成像卫星调度问题时容易陷入局部最优。针对这一问题,提出了一种改进的蚁群算法,在可行解构造初期找到一种综合启发信息来生成初始任务链,并用分类消减的方法进行时间窗更新。局部更新时引入扰动机制,信息素更新时添加了信息素限制策略。最后通过仿真实例与遗传算法和传统蚁群算法对比,说明了该方法的可行性和相对优越性。

It easily fall into local optimum to solve the scheduling problem of imaging satellites based on ant colony algorithm. In view of this problem, the improved ant colony algorithm was proposed. The Integrated heuris- tic information to generate the initial task chain and the way of classification abatement to update the time window was given when constructing the feasible solution. Disturbance mechanism added into the process of local updating and the pheromone restriction policies into the process of pheromone updating. Finally, a case given to compare the proposed algorithm with genetic algorithm and traditional ant colony algorithm to validate the feasibility and relative superiority of this method.