CoChat

An improved adaptive large neighborhood search algorithm for multiple agile satellites scheduling

He, Lei, Liu, Xiaolu, Laporte, Gilbert, Chen, Yingwu, Chen, Yingguo · 2018 · Computers & Operations Research
Cited by 200

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.

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

Integrity signals

Registry

Crossref · 10.1016/j.cor.2018.06.020

Cites

4 of 4 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

Cited by

See all 200

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.