Ensemble of Metaheuristic and Exact Algorithm Based on the Divide-and-Conquer Framework for Multisatellite Observation Scheduling
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
Satellite observation scheduling plays a significant role in improving the efficiency of Earth observation systems. To solve the large-scale multisatellite observation scheduling problem, this article proposes an ensemble of metaheuristic and exact algorithms based on a divide-and-conquer framework (EHE-DCF), including a task allocation phase and a task scheduling phase. In the task allocation phase, each task is allocated to a proper orbit based on a metaheuristic incorporated with a probabilistic selection and a tabu mechanism derived from ant colony optimization and tabu search, respectively. In the task scheduling phase, we construct a task scheduling model for every single orbit and solve the model by using an exact method (i.e., branch and bound, B&B). The task allocation and task scheduling phases are performed iteratively to obtain a promising solution. To validate the performance of the EHE-DCF, we compare it with B&B, three divide-and-conquer-based metaheuristics, and a state-of-the-art metaheuristic. Experimental results show that the EHE-DCF can obtain higher scheduling profits and complete more tasks compared with existing algorithms. The EHE-DCF is especially efficient for large-scale satellite observation scheduling problems.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260 · cited 1×
“In future studies, we would extend the proposed approach to solve more complicated EOS scheduling problems, scuh as the agile EOS scheduling problem [48].”
MethodSelf-citationGabrel, V., & Vanderpooten, D. (2002) · European Journal of Operational Research · doi:10.1016/s0377-2217(01)00188-6 · Cited by 124
An exact algorithm for agile earth observation satellite scheduling with time-dependent profits
Peng, G., Song, G., Xing, L., Gunawan, A., & Vansteenwegen, P. (2020) · Computers & Operations Research · doi:10.1016/j.cor.2020.104946 · Cited by 93
Zhu, K.-J., Li, J.-F., & Baoyin, H.-X. (2010) · Acta Astronautica · doi:10.1016/j.actaastro.2009.05.029 · Cited by 71
Robust earth observation satellite scheduling with uncertainty of cloud coverage
Wang, X., Song, G., Leus, R., & Han, C. (2020) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/taes.2019.2947978 · Cited by 70
Self-citationMOEA based memetic algorithms for multi-objective satellite range scheduling problem
Du, Y., Xing, L., Zhang, J., Chen, Y., & He, Y. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100576 · Cited by 69 · cited 1×
“On the other hand, although August 13, 2024 DRAFT heuristic and meta-heuristics have been widely used to solve large-scale scheduling problems [15], [16], [17], [7], the scheduling results of these methods may not have performance guarantees.”
BackgroundSelf-citationA large-scale multiobjective satellite data transmission scheduling algorithm based on SVM+NSGA-II
Zhang, J., Xing, L., Peng, G., Yao, F., & Chen, C. (2019) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2019.100560 · Cited by 48
Research works printed but not linked: 42
- 10.1109/TSMC.2015.2431643 · DOI · Paper page
- 10.1109/TAES.2020.2966902 · DOI
- 10.1109/TAES.2021.3088490 · DOI
- 10.1016/j.ast.2019.105377 · DOI
- 10.1109/TSMCC.2007.900668 · DOI · Paper page
- 10.3390/rs13122377 · DOI · Paper page
- 10.1016/j.chaos.2015.12.003 · DOI
- 10.1109/JSYST.2018.2874223 · DOI · Paper page
- 10.1155/2018/2103625 · DOI
- 10.1016/j.swevo.2021.100912 · DOI
- Zhu, 2019, A two-phase genetic annealing method for integrated earth observation satellite scheduling problems, Soft Comput., 23, 181, 10.1007/s00500-017-2889-8 · DOI
- 10.1109/7.53453 · doi:10.1109/7.53453
- 10.1016/j.cie.2017.09.050 · DOI
- 10.1109/ICMAE.2018.8467667 · DOI
- 10.1016/j.asr.2019.01.043 · DOI · Paper page
- 10.1109/JSYST.2019.2961236 · DOI
- 10.1016/j.cie.2021.107292 · DOI
- 10.1109/TSMC.2019.2962205 · DOI
- 10.1109/CSSE.2008.577 · DOI
- Plaunt, 1999, Satellite tele-communications scheduling as dynamic constraint satisfaction, 440, 277
- 10.1080/0305215X.2019.1657113 · DOI
- Vasquez, 2003, Upper bounds for the spot 5 daily photograph scheduling problem, J. Combinatorial Optim., 7, 87, 10.1023/A:1021950608048 · DOI · Paper page
- 10.1016/j.cja.2018.12.018 · DOI · Paper page
- 10.1109/LWC.2018.2872996 · doi:10.1109/lwc.2018.2872996
- 10.1016/j.ast.2013.04.001 · DOI
- 10.1016/j.cor.2018.12.007 · DOI
- 10.1109/PEITS.2009.5407045 · DOI
- 10.2991/isccca.2013.169 · DOI
- 10.4028/www.scientific.net/AMR.791-793.1341 · DOI
- 10.1016/j.eswa.2013.10.014 · DOI
- 10.1007/s10489-018-1144-z · DOI
- 10.1109/AICI.2009.87 · DOI
- 10.1016/j.actaastro.2019.10.041 · DOI · Paper page
- 10.1016/j.amc.2013.12.109 · DOI · Paper page
- 10.1109/JSEE.2012.00089 · DOI · Paper page
- 10.1016/j.ejor.2005.12.026 · DOI · Paper page
- 10.1109/TAES.2021.3115587 · DOI
- Hoare, 1962, Quicksort, Comput. J., 5, 10, 10.1093/comjnl/5.1.10 · DOI · Paper page
- Chu, 1998, A genetic algorithm for the multidimensional knapsack problem, J. Heuristics, 4, 63, 10.1023/A:1009642405419 · DOI · Paper page
- 10.1016/j.asoc.2018.04.021 · DOI
- 10.1109/ACCESS.2019.2928992 · DOI
- 10.1109/ICMIC.2011.5973764 · DOI
Cited by
Song, Y., Ou, J., Pedrycz, W., Suganthan, P. N., Wang, X., Xing, L., & Zhang, Y. (2024) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2023.3345928 · Cited by 63
Self-citationWen, Z., Li, L., Song, J., Zhang, S., & Hu, H. (2023) · Advances in Space Research · doi:10.1016/j.asr.2022.10.024 · Cited by 46
Scheduling multiple agile Earth observation satellites with multiple observations
Wang, X., Han, C., & Leus, R. (2026) · Advances in Space Research · doi:10.1016/j.asr.2025.10.042 · Cited by 24
Self-citation
Metadata
- Authors
- Wu, G., Luo, Q., Du, X., Chen, Y., Suganthan, P. N., & Wang, X.
- Venue
- IEEE Transactions on Aerospace and Electronic Systems
- Published
- 2022-10
- Volume
- 58
- Issue
- 5
- Pages
- 4396-4408
- ISSN
- 0018-9251 (ISSN-L)
- 1557-9603
- 2371-9877
- OpenAlex
- W4220794919
- Cited by
- 82
- References
- 7
- FWCI
- 6.32
- Type
- journal article
- Language
- en
- Open access
- green
- Licence
- Funders
- National Natural Science Foundation of China (61603404, 71801218)
- Natural Science Fund for Distinguished Young Scholars of Hunan Province (2019JJ20026)
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
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.