Multiobjective Design of 2D Hyperchaotic System Using Leader Pareto Grey Wolf Optimizer
The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
A chaotic system is a mathematical model exhibiting random and unpredictable behavior. However, existing chaotic systems suffer from suboptimal parameters regarding chaotic indicators. In this study, a novel leader Pareto grey wolf optimizer (LP-GWO) is proposed for multiobjective (MO) design of 2D parametric hyperchaotic system (2D-PHS). The MO capability of LP-GWO is improved by integrating a LP solution within the Pareto optimal set. The effectiveness of LP-GWO is corroborated through a comparison with regular MO versions of grey wolf optimizer (GWO), artificial bee colony, particle swarm optimization, and differential evolution. Additionally, the validation extends to the exploration of LP-GWO’s performance across four variants of the 2D-PHS optimized by the compared algorithms. A 2D-PHS model with eight parameters is conceived and then optimized using LP-GWO by ensuring tradeoff between two objectives: Lyapunov exponent (LE) and Kolmogorov entropy (KE). A globally optimal design is chosen for freely improving the two objectives. The chaotic performance of 2D-PHS significantly outperforms existing systems in terms of precise chaos indicators. Therefore, the 2D-PHS has the best ergodicity and erraticity due to optimal parameters provided by LP-GWO.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Physiological time-series analysis using approximate entropy and sample entropy
Richman, J. S., & Moorman, J. R. (2000) · American Journal of Physiology-Heart and Circulatory Physiology · doi:10.1152/ajpheart.2000.278.6.h2039 · Cited by 7,880
Cosine-transform-based chaotic system for image encryption
Hua, Z., Zhou, Y., & Huang, H. (2019) · Information Sciences · doi:10.1016/j.ins.2018.12.048 · Cited by 776 · cited 1×
“A bifurcation diagram is a graphical representation that illustrates how the behavior of a system changes as a parameter is varied [28], [29], [30].”
BackgroundImage encryption algorithm based on 2D hyperchaotic map
Gao, X. (2021) · Optics & Laser Technology · doi:10.1016/j.optlastec.2021.107252 · Cited by 160 · cited 6×
“…the reported chaotic systems have been generally constructed on infinity collapse [7], [8], [9], [10], [11], [12], [13], sine/cosine [7], [8], [9], [10], [11], [12], [13], [14], polynomial [11], tent [12], Authorized licensed use limited to the terms of the applicable license agreement with…”
BackgroundInfluential
Cited by
Gao, S., Ho-Ching Iu, H., Erkan, U., Simsek, C., Toktas, A., Cao, Y., Wu, R., Mou, J., Li, Q., & Wang, C. (2025) · IEEE Transactions on Circuits and Systems for Video Technology · doi:10.1109/tcsvt.2025.3545868 · Cited by 250
“C HAOS systems are widely recognized for their ability to generate pseudo-random signals [1], [2], [3], [4], making them highly applicable in fields such as cryptography, control theory, and other related domains [5], [6].”
Self-citationA Parallel Color Image Encryption Algorithm Based on a 2-D Logistic-Rulkov Neuron Map
Gao, S., Zhang, Z., Iu, H. H.-C., Ding, S., Mou, J., Erkan, U., Toktas, A., Li, Q., Wang, C., & Cao, Y. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3540097 · Cited by 168
Self-citationGao, S., Ding, S., Ho-Ching Iu, H., Erkan, U., Toktas, A., Simsek, C., Wu, R., Xu, X., Cao, Y., & Mou, J. (2025) · Chaos: An Interdisciplinary Journal of Nonlinear Science · doi:10.1063/5.0270220 · Cited by 100
Self-citationDesign of a three-dimensional logistic map and its application to seafood image encryption
Ding, S., Shi, F., Erkan, U., Toktas, A., Li, Q., Wang, C., Gao, S., & Mou, J. (2026) · The Journal of Supercomputing · doi:10.1007/s11227-025-08196-5 · Cited by 56
Self-citationAlexan, W., & Megalli, Y. (2025) · Discover Electronics · doi:10.1007/s44291-025-00116-4 · Cited by 37
“conditions, ergodicity, and topological mixing [4–6].”
Metadata
- Authors
- Toktas, A., Erkan, U., Ustun, D., & Lai, Q.
- Venue
- IEEE Transactions on Systems, Man, and Cybernetics: Systems
- Published
- 2024-09
- Volume
- 54
- Issue
- 9
- Pages
- 5237-5247
- ISSN
- 2168-2216 (ISSN-L)
- 2168-2232
- OpenAlex
- W4399402497
- Cited by
- 67
- References
- 3
- FWCI
- 9.97
- 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.