An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The multiple agile satellites scheduling problem is a time-dependent scheduling problem which is considerably more difficult than the single agile satellite scheduling problem, due to its much larger solution space. We extend the adaptive large neighborhood search (ALNS) developed for the single satellite scheduling problem to the multiple satellite case. An adaptive task assignment mechanism is introduced into the ALNS framework by defining five assignment operators. In the adaptive task assignment based ALNS (A-ALNS), the removal operators remove tasks from the current solution, the insertion operators insert tasks in the destroyed solution, and if the solution has not improved for a number of iterations, the assignment operators will reassign tasks to different satellites. These operators are selected adaptively to guide the algorithm to search the solution space efficiently. The effect of the parameters on the algorithm performance is studied in the simulation experiments, and the operators are also compared. Extensive computational results show that the proposed adaptive task assignment mechanism is more efficient than competing state-of-the-art multi-satellite processing methods. The A-ALNS metaheuristic performs effectively, handling the complexity brought by the large number of satellites and fulfilling more tasks with a good robustness.
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
Selecting and scheduling observations of agile satellites
Lemaı̂tre, M., Verfaillie, G., Jouhaud, F., Lachiver, J.-M., & Bataille, N. (2002) · Aerospace Science and Technology · doi:10.1016/s1270-9638(02)01173-2 · Cited by 472
Liu, X., Laporte, G., Chen, Y., & He, R. (2017) · Computers & Operations Research · doi:10.1016/j.cor.2017.04.006 · Cited by 250
Self-citationMaximizing the value of an Earth observation satellite orbit
Cordeau, J.-F., & Laporte, G. (2005) · Journal of the Operational Research Society · doi:10.1057/palgrave.jors.2601926 · Cited by 150
An anytime branch and bound algorithm for agile earth observation satellite onboard scheduling
Chu, X., Chen, Y., & Tan, Y. (2017) · Advances in Space Research · doi:10.1016/j.asr.2017.07.026 · Cited by 110
Self-citation
Cited by
Wang, X., Wu, G., Xing, L., & Pedrycz, W. (2021) · IEEE Systems Journal · doi:10.1109/jsyst.2020.2997050 · Cited by 260
“[82] further extend the aforementioned model to consider AEOSSP with multiple AEOSs.”
BackgroundMethodPeng, G., Dewil, R., Verbeeck, C., Gunawan, A., Xing, L., & Vansteenwegen, P. (2019) · Computers & Operations Research · doi:10.1016/j.cor.2019.05.030 · Cited by 113
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
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
“Following [50] and [51], we generate instances in which the observation targets are randomly distributed worldwide, augmented with concentrations in specific interest areas.”
MethodWen, 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
Metadata
- Authors
- He, L., Liu, X., Laporte, G., Chen, Y., & Chen, Y.
- Venue
- Computers & Operations Research
- Publisher
- Elsevier BV
- Published
- 2018-12
- Volume
- 100
- Pages
- 12-25
- ISSN
- 0305-0548 (ISSN-L)
- OpenAlex
- W2868905238
- Cited by
- 200
- References
- 4
- FWCI
- 10.72
- Type
- journal article
- Language
- en
- Open access
- closed
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.