Discussing the article: "Chaos optimization algorithm (COA)"

 

Check out the new article: Chaos optimization algorithm (COA).

This is an improved chaotic optimization algorithm (COA) that combines the effects of chaos with adaptive search mechanisms. The algorithm uses a set of chaotic maps and inertial components to explore the search space. The article reveals the theoretical foundations of chaotic methods of financial optimization.

Demonstration of key properties of chaotic behavior: determinism (trajectories are smooth, not random), ergodicity (particles explore the entire space), sensitivity to initial conditions (different particles move along different trajectories), while the search dynamics display a glow of varying intensity, showing the "energy" of the search in different areas, where concentric circles around the optimum symbolize areas of attraction, blurring and gradients convey the continuity of the search space. The main stages of the algorithm:

  • wide search away from the center (distant particles),
  • gradual approach to promising zones (average trajectories),
  • local search near the optimum (particles close to the center).

The resulting image can be seen as a "portrait" of chaotic optimization, where chaos is presented not as disorder, but as a controlled process of exploring the solution space.

Chaos_1

Figure 1. Visualization of chaotic optimization


Author: Andrey Dik