The DOI matches its Crossref record; 22 of the 22 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
Holland, J. H. (1992) · The MIT Press eBooks · doi:10.7551/mitpress/1090.001.0001 · Cited by 47,002
Linear Matrix Inequalities in System and Control Theory
Boyd, S., El Ghaoui, L., Feron, E., & Balakrishnan, V. (1994) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970777 · Cited by 21,687
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Press, W. H., Teukolsky, S. A., Vetterling, W. T., & Flannery, B. P. (1994) · Cited by 15,411
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1992) · Artificial Intelligence · doi:10.1007/978-3-662-02830-8 · Cited by 11,553
Genetic Algorithms + Data Structures = Evolution Programs
Michalewicz, Z. (1996) · Springer eBooks · doi:10.1007/978-3-662-03315-9 · Cited by 5,095
Haupt, R. L., & Haupt, S. E. (2003) · Wiley eBooks · doi:10.1002/0471671746 · Cited by 4,246
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
Taussky, O., & Knuth, D. E. (1970) · The American Mathematical Monthly · doi:10.2307/2317055 · Cited by 3,822
Genetic Algorithms and Engineering Optimization
Gen, M., & Cheng, R. (1999) · doi:10.1002/9780470172261 · Cited by 2,548
Chaos and Fractals: New Frontiers of Science
Peitgen, H.-O., Jürgens, H., & Saupe, D. (1992) · Springer eBooks · doi:10.1007/978-1-4757-4740-9 · Cited by 1,977
Practical numerical algorithms for chaotic systems
(1990) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(90)90156-d · Cited by 1,506
(1998) · Choice Reviews Online · doi:10.5860/choice.35-5711 · Cited by 1,408
Practical Numerical Algorithms for Chaotic Systems
Parker, T. S., & Chua, L. O. (1989) · Springer eBooks · doi:10.1007/978-1-4612-3486-9 · Cited by 1,375
Random number generators: good ones are hard to find
Park, S. K., & Miller, K. W. (1988) · Communications of the ACM · doi:10.1145/63039.63042 · Cited by 1,262
The Evolution of Strategies in the Iterated Prisoner's Dilemma
Axelrod, R. (2001) · Cited by 672
Efficient and portable combined random number generators
L'Ecuyer, P. (1988) · Communications of the ACM · doi:10.1145/62959.62969 · Cited by 494
A neural network model as a globally coupled map and applications based on chaos
Nozawa, H. (1992) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/1.165880 · Cited by 280
Genetic Algorithms in Engineering Systems
(1997) · Institution of Engineering and Technology eBooks · doi:10.1049/pbce055e · Cited by 241
On chaotic simulated annealing
Wang, L., & Smith, K. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/72.701185 · Cited by 186
Global searching ability of chaotic neural networks
Chen, L., & Aihara, K. (1999) · IEEE Transactions on Circuits and Systems I Fundamental Theory and Applications · doi:10.1109/81.780378 · Cited by 134
Manganaro, G., & de Gyvez, J. P. (2002) · IEEE International Conference on Evolutionary Computation (ICEC) · doi:10.1109/icec.1997.592306 · Cited by 39
Cited by
An Improved Particle Swarm Optimization for Nonconvex Economic Dispatch Problems
Park, J.-B., Jeong, Y.-W., Shin, J.-R., & Lee, K. Y. (2010) · IEEE Transactions on Power Systems · doi:10.1109/tpwrs.2009.2030293 · Cited by 627
Such, F. P., Madhavan, V., Conti, E., Lehman, J., Stanley, K. O., & Clune, J. (2017) · arXiv (Cornell University) · doi:10.48550/arxiv.1712.06567 · Cited by 525
Chaos embedded particle swarm optimization algorithms
Alatas, B., Akin, E., & Ozer, A. B. (2009) · Chaos, Solitons & Fractals · doi:10.1016/j.chaos.2007.09.063 · Cited by 523
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 Local Search-Based Differential Evolution Algorithms for Optimization
Gao, S., Yu, Y., Wang, Y., Wang, J., Cheng, J., & Zhou, M. (2021) · IEEE Transactions on Systems, Man, and Cybernetics: Systems · doi:10.1109/tsmc.2019.2956121 · Cited by 368
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
- 22
- 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
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.