A Memetic Algorithm for Single-orbit Image Scheduling of Agile Satellite

This article analyzes the complex time constraints such as time window visibility and attitude transition time of the single-orbit image scheduling problem for agile satellite, establishes a constrained optimization model and proposes a memetic algorithm to tackle this NP-hard problem. In our algorithm, binary and permutation representation is combined to represent selecting and timetabling sub problem respectively, mixture of feasible and infeasible solutions are allowed to maintain population diversity, tabu search is introduced after crossover and mutation to improve local optimum. In the aspect of constraint handling, a repair method along with penalty function is developed. Experimental results show that this algorithm is a feasible approach for solving the above problem.