Future Generation Computer Systems
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
PPSN VII Proceedings of the 7th International Conference on Parallel Problem Solving from Nature
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Journal of Scheduling
A new ant colony optimization algorithm for the multidimensional Knapsack problem
Computers and Operations Research
Graph colouring approaches for a satellite range scheduling problem
Journal of Scheduling
Population declining ant colony optimization algorithm and its applications
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A Lagrangian heuristic for satellite range scheduling with resource constraints
Computers and Operations Research
Two-stage updating pheromone for invariant ant colony optimization algorithm
Expert Systems with Applications: An International Journal
A new hybrid ant colony optimization algorithm for feature selection
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
A hybrid ant colony optimization algorithm for optimal multiuser detection in DS-UWB system
Expert Systems with Applications: An International Journal
Ant system: optimization by a colony of cooperating agents
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Hi-index | 12.05 |
The multi-satellite control resource scheduling problem (MSCRSP) is a kind of large-scale combinatorial optimization problem. As the solution space of the problem is sparse, the optimization process is very complicated. Ant colony optimization as one of heuristic method is wildly used by other researchers to solve many practical problems. An algorithm of multi-satellite control resource scheduling problem based on ant colony optimization (MSCRSP-ACO) is presented in this paper. The main idea of MSCRSP-ACO is that pheromone trail update by two stages to avoid algorithm trapping into local optima. The main procedures of this algorithm contain three processes. Firstly, the data get by satellite control center should be preprocessed according to visible arcs. Secondly, aiming to minimize the working burden as optimization objective, the optimization model of MSCRSP, called complex independent set model (CISM), is developed based on visible arcs and working periods. Ant colony algorithm can be used directly to solve CISM. Lastly, a novel ant colony algorithm, called MSCRSP-ACO, is applied to CISM. From the definition of pheromone and heuristic information to the updating strategy of pheromone is described detailed. The effect of parameters on the algorithm performance is also studied by experimental method. The experiment results demonstrate that the global exploration ability and solution quality of the MSCRSP-ACO is superior to existed algorithms such as genetic algorithm, iterative repair algorithm and max-min ant system.