Solving Large-scale Relay Satellite Scheduling Problem with A Dynamic Population Firework Algorithm - A Case Study.

A relay satellite is an important type of artificial earth satellite. Using a relay satellite to obtain data or upload instructions to other satellites can make satellite systems work more efficiently. This paper studies the large-scale relay satellite scheduling problem (LSRSSP) and establishes a mathematical model to describe this problem. We combine a dynamic population adjustment strategy with the firework algorithm (FWA-DP) and vary the population size to improve the algorithm's search performance. Through a large number of experiments, it can be seen that the proposed algorithm solves the LSRSSP problem well and can be applied to an actual relay satellite scheduling system.