An Improved Method for Complex Constraints on TT&C Scheduling Problem

In large-scale satellite and station Telemetry, Tracking, and Command (TT&C) Scheduling problems, constraints are the major difference between theoretical design and realistic scenarios. To solve the practical problems, we propose an improved method to handle complex constraints. This paper first refines and simplifies the complex constraints, and then gives a two-stage algorithm with circle combination selection (TACCS): the first stage solves most of the complex constraints and screens out the satellite circles that satisfy the constraints; the second stage applies the mainstream algorithm and modifies the cost function to optimize the scheduling results. Experiments demonstrate that TACCS can handle complex constraints successfully while improving solution efficiency and reducing the antenna's idle time.