Route-reduction-based dynamic programming for large-scale satellite range scheduling problem
The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Abstract
Satellites offer many services through communication with stations, such as tracking, navigation, telecommand uplink, earth observation, etc. How to coordinate these services is referred to as the satellite range scheduling problem (SRSP). In the research, it is found that only the resources (referring to time slots of stations) requested by more than one satellite simultaneously influence scheduling results. These resources are called critical resources and selected as scheduling elements, which makes some jobs optimally served in advance and the problem be decomposable into a multi-stage decision process, so dynamic programming is suitable to be employed. For large-scale SRSPs, a route-reduction-based dynamic programming (RR-DP) is presented, wherein a multi-level route reduction strategy is adopted to alleviate ‘the curse of dimensionality’. Experimental results reveal that RR-DP can find optimal solutions for small-to-medium sized problems and outperforms state-of-the-art methods for large-scale problems.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Schedule Optimization Using Genetic Algorithms
Syswerda, G. (1991) · Medical Entomology and Zoology · Cited by 494
Scheduling Space–Ground Communications for the Air Force Satellite Control Network
Barbulescu, L., Watson, J.-P., Whitley, L. D., & Howe, A. E. (2004) · Journal of Scheduling · doi:10.1023/b:josh.0000013053.32600.3c · Cited by 232 · cited 10×
“These algorithms include greedy algorithms (Barbulescu et al. 2004), Lagrangian versions of relaxation-based mixed integer programming (MIP) heuristics (Marinelli et al. 2011) and exact polynomial time algorithms (Vazquez and Erwin 2014), among others.”
BackgroundMethodInfluentialGraph colouring approaches for a satellite range scheduling problem
Zufferey, N., Amstutz, P., & Giaccari, P. (2008) · Journal of Scheduling · doi:10.1007/s10951-008-0066-8 · Cited by 177 · cited 6×
“Through studying the similarities between graph colouring problems (GCPs) and SRSPs, Zufferey, Amstutz, and Giaccari (2008) proposed the TS-MURRSP algorithm, wherein the stations correspond to the colours and the jobs are analogous to the vertices of the graph.”
BackgroundMethodInfluentialA Lagrangian heuristic for satellite range scheduling with resource constraints
Marinelli, F., Nocella, S., Rossi, F., & Smriglio, S. (2011) · Computers & Operations Research · doi:10.1016/j.cor.2011.01.016 · Cited by 177 · cited 4×
“Marinelli et al. (2011) proposed a Lagrangian fix-and-relaxMIP heuristic (L-FR-Heu) which searches froman infeasible solution obtained fromaLagrangian relaxation of the problem.”
BackgroundMethodInfluentialXu, R., Chen, H., Liang, X., & Wang, H. (2016) · Expert Systems with Applications · doi:10.1016/j.eswa.2015.12.039 · Cited by 165 · cited 1×
“The first one takes jobs as scheduling elements (Barbulescu et al. 2004; Zufferey, Amstutz, and Giaccari 2008; Marinelli et al. 2011; Liu et al. 2014; Xu et al. 2016).”
BackgroundMulti-satellite control resource scheduling based on ant colony optimization
Zhang, Z., Zhang, N., & Feng, Z. (2013) · Expert Systems with Applications · doi:10.1016/j.eswa.2013.10.014 · Cited by 126
Self-citationOn the tractability of satellite range scheduling
Vazquez, A. J., & Erwin, R. S. (2015) · Optimization Letters · doi:10.1007/s11590-014-0744-8 · Cited by 61
Multi satellites scheduling algorithm based on task merging mechanism
Xiaolu, L., Baocun, B., Yingwu, C., & Feng, Y. (2014) · Applied Mathematics and Computation · doi:10.1016/j.amc.2013.12.109 · Cited by 59 · cited 1×
“The first one takes jobs as scheduling elements (Barbulescu et al. 2004; Zufferey, Amstutz, and Giaccari 2008; Marinelli et al. 2011; Liu et al. 2014; Xu et al. 2016).”
BackgroundFireworks algorithm for the multi-satellite control resource scheduling problem
Liu, Z., Feng, Z., & Ke, L. (2015) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2015.7257036 · Cited by 32 · cited 2×
“When an LEO satellite passes over, the arcs created with different stations may have overlaps (Zhang, Feng, and Ke 2011; Zhang, Zhang, and Feng 2014; Liu, Feng, and Ke 2015; Zhang et al. 2018).”
BackgroundSelf-citationOptimal Allocation of Satellite Network Resources
Burrowbridge, S. E. (1999) · VTechWorks (Virginia Tech) · Cited by 31
Research works printed but not linked: 1
- Bertsekas Dimitri P., 1999, Nolinear Programming
Cited by
Deep Reinforcement Learning Method for Satellite Range Scheduling Problem
Ou, J., Xing, L., Yao, F., Li, M., Lv, J., He, Y., Song, Y., Wu, J., & Zhang, G. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101233 · Cited by 91
Satellite Scheduling Problems: A survey of applications in Earth and outer space observation
Ferrari, B., Cordeau, J., Delorme, M., Iori, M., & Orosei, R. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106875 · Cited by 62
“Finally, to simplify the problem Liu et al. (2019) considered as the resource set only the critical resources, i.e., ground stations requested by more than one satellite simultaneously.”
BackgroundWang, T., Luo, Q., Zhou, L., & Wu, G. (2023) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2023.101396 · Cited by 36
Wang, T., Gu, Y., Wang, H., & Wu, G. (2024) · Computers & Operations Research · doi:10.1016/j.cor.2024.106757 · Cited by 34
Energy-Efficient Satellite Range Scheduling Using a Reinforcement Learning-Based Memetic Algorithm
Song, Y., Suganthan, P. N., Pedrycz, W., Yan, R., Fan, D., & Zhang, Y. (2024) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2024.3371964 · Cited by 42
“Somestudies have also focused on minimizing task failure rate [18] and maximizing task priority [19] as optimization objectives.”
Background
Metadata
- Authors
- Liu, Z., Feng, Z., & Ren, Z.
- Affiliations
- Xi'an Jiaotong University (CN)
- Corresponding author
- Feng, Zuren
- Venue
- Engineering Optimization
- Publisher
- Informa UK Limited
- Published
- 2019-01-24
- Volume
- 51
- Issue
- 11
- Pages
- 1944-1964
- ISSN
- 0305-215X (ISSN-L)
- 1029-0273
- OpenAlex
- W2912997292
- Cited by
- 24
- References
- 17
- Citations by year
- 2026: 3 · 2025: 3 · 2024: 7 · 2023: 7 · 2022: 3 · 2020: 1
- FWCI
- 0.74
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Engineering Optimization (publishedVersion)
- Funders
- National Natural Science Foundation of China (61873199)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
- Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Vehicle Routing Optimization Methods
- Keywords
- dynamic programming, multi-stage decision making, critical resources, time slot allocation, curse of dimensionality, large-scale scheduling, satellite communication services
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Route-reduction-based dynamic programming for large-scale satellite range scheduling problem. https://app.cochat.ai/papers/10.1080/0305215x.2018.1558445
- The paper
- Liu, Z., Feng, Z., & Ren, Z. (2019). Route-reduction-based dynamic programming for large-scale satellite range scheduling problem. Engineering Optimization. https://doi.org/10.1080/0305215x.2018.1558445
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.