{'fraction_non_alphanumeric': 0.020553359683794466, 'fraction_numerical': 0.0, 'mean_word_length': 5.145631067961165, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A Genetic Algorithm for Ground Station Scheduling

In this paper we address the resolution of the Ground Station Scheduling problem by Genetic Algorithms. Ground Stations (GS) are required during spacecraft (S/C) operations to provide communications links between operations teams and the S/C systems. Basic communication types, such as telemetry, tele-command and tracking, are all supported by the same satellite and GS systems. The allocation of ground resources to S/C is a highly constrained problem and traditionally has been conducted manually: stations are selected for communication support with certain S/C for certain periods. The manual approach has clear limitations and new modern scheduling approaches are needed to tackle with the complexity of the problem and produce optimal solutions to scheduling operations. We propose the use of Genetic Algorithm, a well-known family of population-based methods, for solving the problem. A series of genetic operators have been designed to find the configuration that outputs the best GA solution for the problem. The proposed GA has been implemented in Matlab and experimentally studied on a set of randomly generated instances. The results of the study showed the effectiveness of the proposed GA algorithm.