Satellite mission scheduling using genetic algorithm

Todaypsilas high-resolution imaging satellites have complicated missions with an agility capability. For this reason, interesting and studying of the optimization problem of satellite mission scheduling have been increased since 1980s. This paper describes the results of mission scheduling using a genetic algorithm. In this paper, the feasibility of applying the genetic algorithm to the satellite mission scheduling is demonstrated. The computational time and quality of the solutions are usually considered in mission scheduling problem. Two methods, tournament and roulette wheel, of selection operator are applied in this work. The effects of the number of iterations and limitation of memory on the performance are also investigated through the case study. Consequently, the optimization algorithm-based scheduler using a genetic algorithm implemented in this work is expected to reduce the load of mission scheduling task and improve the efficiency in generating the conflict-free mission timeline.