Cited by 51Satellite Communication SystemsMetaheuristic Optimization Algorithms ResearchScheduling and Optimization Algorithms

The DOI matches its Crossref record; 13 of the 13 references it cites were found in a registry or an index.

Evaluation of struggle strategy in Genetic Algorithms for ground stations scheduling problem

Open access
Xhafa, Fatos, Herrero, Xavier, Barolli, Admir, Barolli, Leonard, Takizawa, Makoto·2013·Journal of Computer and System Sciences

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1016/j.jcss.2013.01.023

Cites

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Flagged first, then by citations

Research works printed but not linked: 1

  1. S. Damiani, H. Dreihahn, J. Noll, M. Niézette, G.P. Calzolari, A planning and scheduling system to allocate ESA ground station network services, in: The Intʼl Conference on Automated Planning and Scheduling, USA, 2007.

Cited by

Sorted by citations

Metadata

Authors
Xhafa, F., Herrero, X., Barolli, A., Barolli, L., & Takizawa, M.
Affiliations
  • Universitat Politècnica de Catalunya (ES)
  • Seikei University (JP)
  • Fukuoka Institute of Technology (JP)
Corresponding author
Xhafa, Fatos
Venue
Journal of Computer and System Sciences
Publisher
Elsevier BV
Published
2013-11
Volume
79
Issue
7
Pages
1086-1100
ISSN
0022-0000 (ISSN-L)
OpenAlex
W1985427319
Cited by
51
References
13
Citations by year
2026: 3 · 2025: 2 · 2024: 4 · 2023: 5 · 2022: 3 · 2021: 4 · 2020: 5 · 2019: 2 · 2018: 6 · 2017: 4 · 2016: 2 · 2015: 5 · 2014: 4 · 2013: 2
FWCI
6.60
Type
journal article
Language
en
Open access
Locations
  • Journal of Computer and System Sciences (publishedVersion)
  • LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (acceptedVersion, cc-by-nc-nd)
  • RECERCAT (Consorci de Serveis Universitaris de Catalunya) (acceptedVersion, other-oa)
  • UPCommons institutional repository (Universitat Politècnica de Catalunya) (submittedVersion, cc-by-nc-nd)
Funders
Japan Society for the Promotion of Science (23300029)
Topics
  • Physical Sciences › Engineering › Aerospace Engineering › Satellite Communication Systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Engineering › Industrial and Manufacturing Engineering › Scheduling and Optimization Algorithms
Keywords
ground station scheduling, satellite scheduling, spacecraft operations, population diversity, over-constrained problems, STK simulation

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