Heuristic Algorithm and Conflict-Based Backjumping Algorithm for Satellite TT&C Resource Scheduling
Yongxuan Huang · Journal of Astronautics · 2007
According to the characteristic of two different applications,the constraint satisfaction model is established,and then a heuristic algorithm and a conflict-based backjumping algorithm are proposed to solve the model.Principles of balance,efficiency and minimal interval are designed to lead the solutions searching process to multi-objective optimization,which is beneficial to both the task accomplishment ratio and the stations' load balancing and efficiency.At last,a 6-station 10-satellite scheduling problem is studied,and the simulation results shows that,compared with genetic algorithm,the algorithms proposed in this paper can produce better solutions quickly with high task accomplishment ratio and balanceable load.