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

14Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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

Cite

CITATION STYLE

APA

Li, Y., Wang, R., Liu, Y., & Xu, M. (2015). Satellite range scheduling with the priority constraint: An improved genetic algorithm using a station ID encoding method. Chinese Journal of Aeronautics, 28(3), 789–803. https://doi.org/10.1016/j.cja.2015.04.012

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free