An Evolution Algorithm for Satellite Range Scheduling Problem with Priority Constraint

The satellite range scheduling problem is one of the most important problems in the field of the satellite operation. The purpose of this problem is finding the optimal feasible schedules, scheduling the communications between satellites and ground stations effectively, in another word. The problem is known for its high complexity and is an over-constrained problem. This paper present the resolution of the problem through a Station Coding Based Evolution Algorithm, particularly with the priority constraint, which adopting a new chromosome encoding method based on arranging the tasks in the ground station ID order. Computational results and analysis are presented for the case of the multi-ground stations scheduling.