A Hill Climbing Algorithm for Ground Station Scheduling
The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“SAA4GS, QPSO4DT, and HGANS are all based on nature-inspired metaheuristic algorithms and perform well in relation to their own problems.”
From A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics (2020) · cites this paper as [20]
Citations
Cites
Satellite Range Scheduling: A Comparison of Genetic, Heuristic and Local Search
Barbulescu, L. V., Howe, A. E., Watson, J., & Whitley, L. D. (2002) · Lecture notes in computer science · doi:10.1007/3-540-45712-7_59 · Cited by 61
Task Scheduling for Satellite Based Imagery
Harrison, S., & Philpott, M. (1999) · Cited by 58
ON THE NEED FOR DYNAMIC SCHEDULING OF IMAGING SATELLITES
Pemberton, J. C., & Greenwald, L. G. (2002) · Cited by 49
Approximation Algorithms for Fixed Job Schedule Problems
Fischetti, M., Martello, S., & Toth, P. (1992) · Operations Research · doi:10.1287/opre.40.1.s96 · Cited by 47
New tabu search heuristic in scheduling earth observation satellites
Sarkheyli, A., Ghorbani Vaghei, B., & Bagheri, A. (2010) · 2010 2nd International Conference on Software Technology and Engineering · doi:10.1109/icste.2010.5608821 · Cited by 35
On the computational complexity of (maximum) shift class scheduling
Kolen, A. W. J., & Kroon, L. (1993) · European Journal of Operational Research · doi:10.1016/0377-2217(93)90014-e · Cited by 30
Steady State Genetic Algorithm for Ground Station Scheduling Problem
Xhafa, F., Barolli, A., & Takizawa, M. (2013) · International Conference on Advanced Information Networking and Applications (AINA) · doi:10.1109/aina.2013.147 · Cited by 19
Self-citationAn approximation algorithm for the license and shift class design problem
Jansen, K. (1994) · European Journal of Operational Research · doi:10.1016/0377-2217(94)90150-3 · Cited by 16
Scheduling earth observation activities in LEO satellites using graph coloring problem
Sarkheyli, A., Vaghei, B. G., Moghadam, R. A., & Bagheri, A. (2010) · International Symposium on Telecommunications · doi:10.1109/istel.2010.5734155 · Cited by 10
Cited by
A Satellite Observation Data Transmission Scheduling Algorithm Oriented to Data Topics
Chen, H., Zhai, B., Wu, J., Du, C., & Li, J. (2020) · International Journal of Aerospace Engineering · doi:10.1155/2020/2180674 · Cited by 12
“Xhafa et al. [9] adopted a heuristic hill climbing algorithm based on the characteristics of a satellite data downlink process.”
Method
Metadata
- Authors
- Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M.
- Affiliations
- Universitat Politècnica de Catalunya (ES)
- Canadian Institute of Technology (AL)
- Hosei University (JP)
- Corresponding author
- Xhafa, Fatos
- Venue
- Lecture Notes in Electrical Engineering
- Publisher
- Springer Netherlands
- Published
- 2013
- Pages
- 131-139
- ISSN
- 1876-1100 (ISSN-L)
- 1876-1119
- OpenAlex
- W2181916190
- Cited by
- 1
- References
- 9
- Citations by year
- 2020: 1
- FWCI
- 0.00
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Lecture notes in electrical engineering (publishedVersion)
- Topics
- Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
- Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
- Social Sciences › Decision Sciences › Management Science and Operations Research › Scheduling and Timetabling Solutions
- Keywords
- ground station scheduling, hill climbing algorithm, local search, time window scheduling, satellite mission planning, resource constraints, combinatorial optimization
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: A Hill Climbing Algorithm for Ground Station Scheduling. https://app.cochat.ai/papers/10.1007/978-94-007-6996-0_14
- The paper
- Xhafa, F., Herrero, X., Barolli, A., & Takizawa, M. (2013). A Hill Climbing Algorithm for Ground Station Scheduling. Lecture Notes in Electrical Engineering. https://doi.org/10.1007/978-94-007-6996-0_14
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.