Uplink scheduling of navigation constellation based on genetic algorithm

摘要

The uplink of navigation constellation is a complex satellite range scheduling problem. The traditional heuristic method is difficult to tackle large scale optimal problem. We proposed a genetic algorithm (GA) to deal with the problem. The method is a multi-objective algorithm considering the maximum task and minimum switch times based on multi-hierarchical encoding method. Several sets of simulation are performed to test the performance of the proposed algorithm. Numerical results show that the proposed method can achieve the minimum switch times with a negligible loss in task number (approximately 7.65%). The genetic algorithm is suitable for different scale of uplink problems and its performance is related to population size and elite size.