The DOI matches its Crossref record.
A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization
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.
Integrity signals
Registry
Cites
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.
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
Cited by
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Fitness sharing and niching methods revisited
Sareni, B., & Krahenbuhl, L. (1998) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.735432 · Cited by 578
Genetic algorithms in computer aided design
Renner, G., & Ekárt, A. (2003) · Computer-Aided Design · doi:10.1016/s0010-4485(03)00003-4 · Cited by 469
Niching Without Niching Parameters: Particle Swarm Optimization Using a Ring Topology
Li, X. (2010) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2009.2026270 · Cited by 466
Differential Evolution With Neighborhood Mutation for Multimodal Optimization
Qu, B. Y., Suganthan, P. N., & Liang, J. J. (2012) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2011.2161873 · Cited by 442
Metadata
- Authors
- Yin, X., & Germay, N.
- Venue
- Artificial Neural Nets and Genetic Algorithms
- Publisher
- Springer Vienna
- Published
- 1993
- Pages
- 450-457
- OpenAlex
- W1516972762
- Cited by
- 238
- References
- 0
- FWCI
- 3.60
- Type
- book chapter
- 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
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 Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization. https://app.cochat.ai/papers/10.1007/978-3-7091-7533-0_65
- The paper
- Yin, X., & Germay, N. (1993). A Fast Genetic Algorithm with Sharing Scheme Using Cluster Analysis Methods in Multimodal Function Optimization. Artificial Neural Nets and Genetic Algorithms. https://doi.org/10.1007/978-3-7091-7533-0_65
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.