CoChat

Ensemble of Metaheuristic and Exact Algorithm Based on the Divide-and-Conquer Framework for Multisatellite Observation Scheduling

Open access
Wu, Guohua, Luo, Qizhang, Du, Xiao, Chen, Yingguo, Suganthan, Ponnuthurai Nagaratnam, Wang, Xinwei · 2022 · IEEE Transactions on Aerospace and Electronic Systems
Cited by 82

The 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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1109/taes.2022.3160993

Cites

7 of 7 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 42

  1. 10.1109/TSMC.2015.2431643 · DOI · Paper page
  2. 10.1109/TAES.2020.2966902 · DOI
  3. 10.1109/TAES.2021.3088490 · DOI
  4. 10.1016/j.ast.2019.105377 · DOI
  5. 10.1109/TSMCC.2007.900668 · DOI · Paper page
  6. 10.3390/rs13122377 · DOI · Paper page
  7. 10.1016/j.chaos.2015.12.003 · DOI
  8. 10.1109/JSYST.2018.2874223 · DOI · Paper page
  9. 10.1155/2018/2103625 · DOI
  10. 10.1016/j.swevo.2021.100912 · DOI
  11. 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
  12. 10.1109/7.53453 · doi:10.1109/7.53453
  13. 10.1016/j.cie.2017.09.050 · DOI
  14. 10.1109/ICMAE.2018.8467667 · DOI
  15. 10.1016/j.asr.2019.01.043 · DOI · Paper page
  16. 10.1109/JSYST.2019.2961236 · DOI
  17. 10.1016/j.cie.2021.107292 · DOI
  18. 10.1109/TSMC.2019.2962205 · DOI
  19. 10.1109/CSSE.2008.577 · DOI
  20. Plaunt, 1999, Satellite tele-communications scheduling as dynamic constraint satisfaction, 440, 277
  21. 10.1080/0305215X.2019.1657113 · DOI
  22. Vasquez, 2003, Upper bounds for the spot 5 daily photograph scheduling problem, J. Combinatorial Optim., 7, 87, 10.1023/A:1021950608048 · DOI · Paper page
  23. 10.1016/j.cja.2018.12.018 · DOI · Paper page
  24. 10.1109/LWC.2018.2872996 · doi:10.1109/lwc.2018.2872996
  25. 10.1016/j.ast.2013.04.001 · DOI
  26. 10.1016/j.cor.2018.12.007 · DOI
  27. 10.1109/PEITS.2009.5407045 · DOI
  28. 10.2991/isccca.2013.169 · DOI
  29. 10.4028/www.scientific.net/AMR.791-793.1341 · DOI
  30. 10.1016/j.eswa.2013.10.014 · DOI
  31. 10.1007/s10489-018-1144-z · DOI
  32. 10.1109/AICI.2009.87 · DOI
  33. 10.1016/j.actaastro.2019.10.041 · DOI · Paper page
  34. 10.1016/j.amc.2013.12.109 · DOI · Paper page
  35. 10.1109/JSEE.2012.00089 · DOI · Paper page
  36. 10.1016/j.ejor.2005.12.026 · DOI · Paper page
  37. 10.1109/TAES.2021.3115587 · DOI
  38. Hoare, 1962, Quicksort, Comput. J., 5, 10, 10.1093/comjnl/5.1.10 · DOI · Paper page
  39. Chu, 1998, A genetic algorithm for the multidimensional knapsack problem, J. Heuristics, 4, 63, 10.1023/A:1009642405419 · DOI · Paper page
  40. 10.1016/j.asoc.2018.04.021 · DOI
  41. 10.1109/ACCESS.2019.2928992 · DOI
  42. 10.1109/ICMIC.2011.5973764 · DOI

Cited by

See all 82

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
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.