Knowledge-Guided Parallel Hybrid Local Search Algorithm for Solving Time-Dependent Agile Satellite Scheduling Problems

• Published in: Symmetry (Basel) Vol. 16; no. 7; p. 813
• Main Authors: Shan, Yuyuan, Wang, Xueping, Cheng, Shi, Zhang, Mingming, Xing, Lining
• Format: Journal Article
• Language: English
• Published: Basel MDPI AG 01.07.2024
• Subjects: Algorithms; Computation; Data mining; Design; Disaster relief; Earth observations (from space); Efficiency; Genetic algorithms; Heuristic; Heuristic methods; Machine learning; Neural networks; Optimization; Problem solving; Satellite observation; Satellites; Scheduling; Search algorithms; Time dependence
• ISSN: 2073-8994; 2073-8994
• DOI: 10.3390/sym16070813

As satellite capabilities have evolved and new observation requirements have emerged, satellites have become essential tools in disaster relief, emergency monitoring, and other fields. However, the efficiency of satellite scheduling still needs to be enhanced. Learning and optimization are symmetrical processes of solving problems. Learning problem knowledge could provide efficient optimization strategies for solving problems. A knowledge-guided parallel hybrid local search algorithm (KG-PHLS) is proposed in this paper to solve time-dependent agile Earth observation satellite (AEOS) scheduling problems more efficiently. Firstly, the algorithm uses heuristic algorithms to generate initial solutions. Secondly, a knowledge-based parallel hybrid local search algorithm is employed to solve the problem in parallel. Meanwhile, data mining techniques are used to extract knowledge to guide the construction of new solutions. Finally, the proposed algorithm has demonstrated superior efficiency and computation time through simulations across multiple scenarios. Notably, compared to benchmark algorithms, the algorithm improves overall efficiency by approximately 7.4% and 8.9% in large-scale data scenarios while requiring only about 60.66% and 31.89% of the computation time of classic algorithms. Moreover, the proposed algorithm exhibits scalability to larger problem sizes.