Fig 11 - available via license: Creative Commons Attribution 4.0 International
Content may be subject to copyright.
Source publication
Satellite range scheduling, a multi-constrained combinatorial optimization problem, is crucial to guaranteeing the normal operation and application of onboard satellites. Traditional methods are dedicated to finding one optimal schedule, having ignored the problem may process multiple high-quality schedules. To provide a set of alternative schedule...
Context in source publication
Similar publications
Workflow scheduling is vital to simultaneously minimize execution cost and makespan for cloud platforms since data dependencies among large-scale workflow tasks and cloud workflow scheduling problem involve large-scale interactive decision variables. So far, the cooperative coevolution approach poses competitive superiority in resolving large-scale...
Citations
... Others [14,[69][70][71] Evolutionary Algorithm Genetic Algorithm [16,59,[72][73][74][75][76][77][78][79][80][81][82][83][84][85][86][87][88] Individual has randomness, algorithm has strong search ability and strong expansibility. ...
... In order to solve different SRSP, scholars have improved the application of GA in different directions. On the one hand, struggle GA [80], adaptive GA [81,82] and coevolutionary algorithm [83] were proposed to prevent premature convergence of GA. On the other hand, GA-PE [84] and GA with a rote learning operator [85] were designed for improving optimization efficiency. ...
With the increasing number of space satellites, the demand for satellite communication (including maneuvering, command uploading and data downloading) has also grown significantly. However, the actual communication resources of ground station are relatively limited, which leads to an oversubscribed problem. How to make use of limited ground station resources to complete satellite communication requests more fully and efficiently in the strict visible time is the focus of satellite range scheduling research. This paper reviews and looks forward to the research on Satellite Range Scheduling Problem (SRSP). Firstly, SRSP is defined as the scheduling problem of establishing communication between satellites and ground stations, and the classification and development of SRSP are introduced. Then, this paper analyzes three common problem description models, and establishes a mathematical model based on the analysis of optimization objectives and constraints. Thirdly, this paper classifies and summarizes the common solving methods of SRSP, and analyzes their characteristics and application scenarios. Finally, combined with the work in this paper, the future research direction of SRSP is envisioned.
... With the rapid increase of the earth observation satellites, the demand for space transmission has been growing greatly [1,2]. Satellites located in low and medium orbits mainly transmit the data of tasks through ground terminals (GTs) and the transmissions largely depend on the coverage of GTs. ...
System disturbances, such as the change of required service durations, the failure of resources, and temporary tasks during the scheduling process of data relay satellite network (DRSN), are difficult to be predicted, which may lead to unsuccessful scheduling of tasks. A high-efficiency and robust DRSN calls for smarter and more flexible disturbances elimination strategies. Here, we unify the above three system disturbances as temporary task arrival and extend the static scheduling model of DRSN. Specifically, we derive and define a scheduling model that unifies the static scheduling and dynamic scheduling processes. Meanwhile, we propose a k -step dynamic scheduling algorithm considering breakpoint transmission ( k -steps-BT) to solve the above model. Based on the principle of backtracking algorithm and search tree, k -steps-BT can eliminate disturbances quickly by rescheduling tasks and can determine the rescheduling scheme when temporary tasks arrive. Finally, extensive experiments are carried out to verify the proposed model and algorithm. The results show that the proposed model and algorithm can significantly improve the task completion rate of dynamic scheduling without drastic adjustments to the static scheduling scheme.
