Skip to Main Content
In order to solve the disadvantage of current ant colony optimization algorithm (ACO) which easily plunged into local optimal in dealing with multi-satellite scheduling problem (MuSSP), a hybrid ant colony optimization algorithm (HACO) is proposed. In this method, the ACO algorithm is served as a global search algorithm. According to the characteristics of the MuSSP, an adaptive memory algorithms is presented, which is used as the local search on the solution space in the hybrid ant colony optimization algorithm. The hybrid algorithm can improve the solution's quality for MuSSP. Several cases showed that the HACO algorithm is feasibility. In addition, compared with ACO, the hybrid algorithm demonstrates that the global optimization ability is better.