The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Chaotic sequences to improve the performance of evolutionary algorithms
Abstract
This paper proposes an experimental analysis on the convergence of evolutionary algorithms (EAs). The effect of introducing chaotic sequences instead of random ones during all the phases of the evolution process is investigated. The approach is based on the substitution of the random number generator (RNG) with chaotic sequences. Several numerical examples are reported in order to compare the performance of the EA using random and chaotic generators as regards to both the results and the convergence speed. The results obtained show that some chaotic sequences are always able to increase the value of some measured algorithm-performance indexes with respect to random sequences. Moreover, it is shown that EAs can be extremely sensitive to different RNGs. Some t-tests were performed to confirm the improvements introduced by the proposed strategy.
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
Cites
Genetic Algorithms and Engineering Optimization
Gen, M., & Cheng, R. (1999) · doi:10.1002/9780470172261 · Cited by 2,548
Cited by
SOMA — Self-Organizing Migrating Algorithm
Zelinka, I. (2004) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-39930-8_7 · Cited by 368
Chaotic harmony search algorithms
Alatas, B. (2010) · Applied Mathematics and Computation · doi:10.1016/j.amc.2010.03.114 · Cited by 287
Metadata
- Authors
- Caponetto, R., Fortuna, L., Fazzino, S., & Xibilia, M. G.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2003-06
- Volume
- 7
- Issue
- 3
- Pages
- 289-304
- ISSN
- 1089-778X (ISSN-L)
- OpenAlex
- W2131302168
- Cited by
- 519
- References
- 1
- FWCI
- 4.95
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Chaotic sequences to improve the performance of evolutionary algorithms. https://app.cochat.ai/papers/10.1109/tevc.2003.810069
- The paper
- Caponetto, R., Fortuna, L., Fazzino, S., & Xibilia, M. G. (2003). Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2003.810069
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.
