Key points are not available for this paper at this time.
Optimization algorithms play a crucial role in a wide range of fields, from designing complex systems to solving mathematical and engineering problems. However, these algorithms frequently face major challenges, such as convergence to local optima, which limits their ability to find global, optimal solutions. To overcome these challenges, it has become imperative to explore more efficient approaches by incorporating chaotic maps within these original algorithms. Incorporating chaotic variables into the search process offers notable advantages, including the ability to avoid local minima, diversify the search, and accelerate convergence toward optimal solutions. In this study, we propose an improved Archimedean optimization algorithm called ChaoticAO (CAO), based on the use of ten distinct chaotic maps to replace pseudorandom sequences in the three essential components of the classical Archimedean optimization algorithm: initialization, density and volume update, and position update. This improvement aims to achieve a more appropriate balance between the exploitation and exploration phases, offering a greater likelihood of discovering global solutions. CAO performance was extensively validated through the exploration of three distinct groups of problems. The first group, made up of twenty-three benchmark functions, served as an initial reference. Group 2 comprises three crucial engineering problems: the design of a welded beam, the modeling of a spring subjected to tension/compression stresses, and the planning of pressurized tanks. Finally, the third group of problems is dedicated to evaluating the efficiency of the CAO algorithm in the field of signal reconstruction, as well as 2D and 3D medical images. The results obtained from these in-depth tests revealed the efficiency and reliability of the CAO algorithm in terms of convergence speeds, and outstanding solution quality in most of the cases studied.
Bencherqui et al. (Sun,) studied this question.