A Resource Scheduling Algorithm for Optical Ground Stations Supporting Satellite Observation Tasks

To address the resource scheduling problem of ground-based optical stations for key space target observation, this study proposes a station-structured genetic algorithm driven by dual-level tabu memory. The proposed method integrates station-grouped encoding, heuristic initialization, station-structured crossover, neighborhood-enhanced mutation, and local and global tabu-memory mechanisms to enhance the search capability under complex constraints and reduce redundant searches. Results from 30 independent runs show that, with population sizes of 150 and 300, the proposed algorithm achieves mean final fitness values of 15,162.784 and 15,870.237, respectively, corresponding to improvements of 62.54% and 63.84% over the single-point crossover strategy and 28.11% and 27.23% over the multi-point crossover strategy. Under the high-load condition with 250 candidate observation tasks, the total observation profit achieved by the proposed algorithm in the LEO target scenario is 30.09%, 9.14%, 13.78%, and 21.60% higher than that achieved by GA, TGA, ACO, and PSO, respectively. In the mixed MEO and HEO target scenario, the corresponding improvements are 29.94%, 6.26%, 13.22%, and 19.67%, respectively. The results demonstrate that the proposed method provides high-quality scheduling solutions, stable performance, and good adaptability to different orbital scenarios under complex resource constraints and high task loads.

Authors

Institutions

Publication Details

Journal
Aerospace
Published
2026-09-30
DOI
https://doi.org/10.3390/aerospace13100892
Primary Topic
Satellite Communication Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
article

A Resource Scheduling Algorithm for Optical Ground Stations Supporting Satellite Observation Tasks

Wenhua Cheng, Tinghua Zhang, Shijie Zhai
Aerospace
Satellite Communication Systems
article

A Resource Scheduling Algorithm for Optical Ground Stations Supporting Satellite Observation Tasks

Wenhua Cheng, Tinghua Zhang, Shijie Zhai
article en

Abstract

To address the resource scheduling problem of ground-based optical stations for key space target observation, this study proposes a station-structured genetic algorithm driven by dual-level tabu memory. The proposed method integrates station-grouped encoding, heuristic initialization, station-structured crossover, neighborhood-enhanced mutation, and local and global tabu-memory mechanisms to enhance the search capability under complex constraints and reduce redundant searches. Results from 30 independent runs show that, with population sizes of 150 and 300, the proposed algorithm achieves mean final fitness values of 15,162.784 and 15,870.237, respectively, corresponding to improvements of 62.54% and 63.84% over the single-point crossover strategy and 28.11% and 27.23% over the multi-point crossover strategy. Under the high-load condition with 250 candidate observation tasks, the total observation profit achieved by the proposed algorithm in the LEO target scenario is 30.09%, 9.14%, 13.78%, and 21.60% higher than that achieved by GA, TGA, ACO, and PSO, respectively. In the mixed MEO and HEO target scenario, the corresponding improvements are 29.94%, 6.26%, 13.22%, and 19.67%, respectively. The results demonstrate that the proposed method provides high-quality scheduling solutions, stable performance, and good adaptability to different orbital scenarios under complex resource constraints and high task loads.

AerospaceVol. 13(10)
Space Engineering University (CN)
Openalex Percentile: Top 8%
Satellite Communication Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.