Satellite range scheduling with the priority constraint: An improved genetic algorithm using a station ID encoding method

• DOI: 10.1016/j.cja.2015.04.012
• Publication Date: 2015-04-17T02:41:18Z
• Authors: Yuqing Li; Rixin Wang; Yu Liu; Minqiang Xu
• Keywords: Roulette; Fitness proportionate selection

Satellite range scheduling with the priority constraint is one of most important problems in field satellite operation. This paper proposes a station coding based genetic algorithm to solve this problem, which adopts new chromosome encoding method that arranges tasks according ground ID. The contributes reducing complexity conflict checking and resolving, helps improve ability find optimal resolutions. Three different selection operators are designed match strategy, namely random selection, greedy roulette selection. To demonstrate benefits improved algorithm, basic two cross presented, single-point crossover multi-point crossover. For purpose test analysis, problem-generating program designed, can simulate by modeling features encountered real-world problems. Based on problem generator, computational results analysis made illustrated for multiple stations.