Parameter optimization of chaotic system using Pareto-based triple objective artificial bee colony algorithm
MetadataShow full item record
CitationToktas, A., Erkan, U., Ustun, D. ve Xingyuan, W. (2023). Parameter optimization of chaotic system using Pareto-based triple objective artificial bee colony algorithm. Neural Computing and Applications 35, 13207–13223. https://doi.org/10.1007/s00521-023-08434-y
Chaotic map is a kind of discrete chaotic system. The existing chaotic maps suffer from optimal parameters in terms of chaos measurements. In this study, a novel approach of optimization of parametric chaotic map (PCM) using triple objective optimization is presented for the first time. A PCM with six parameters is first conceived and then optimized using Pareto-based triple objective artificial bee colony (PT-ABC) algorithm. Pareto optimality is employed to catch the trade-off among the objectives: Lyapunov exponent (LE), sample entropy (SE), and Kolmogorov entropy (KE). A global optimal design including the six parameters is selected for minimizing the reciprocal of the three objectives independently. The chaotic performance of PCM is verified through an evaluation with bifurcation diagram, attractor, LE, SE, KE, and correlation dimension. The results are also validated by comparison with those of which reported elsewhere. Furthermore, the applicability of PCM is examined over image encryption and the results are compared with existing chaos-based IEs. Therefore, the PCM manifests the best ergodicity and complexity thanks to its PT-ABC algorithm.
Showing items related by title, author, creator and subject.
Korban, Adrian; Şahinkaya, Serap; Üstün, Deniz; Dougherty, S. T. (IEEE-INST Electrical Electronics Engineers Inc., 2023)Indexed keywords SciVal Topics Metrics Funding details Abstract In this work, we present a new construction method for reversible codes. We employ composite matrices derived from group rings and show how to ...
Dihedral codes with 1-dimensional hulls and 1-dimensional linear complementary pairs of dihedral codes In this paper, we study dihedral codes with 1-dimensional hulls and we determine precisely when dihedral codes over fnite felds with 1-dimensional hulls exist. Moreover, we show that these codes come canonically in pairs. ...