Research Article
A Chaotic Multi-Objective Runge–Kutta Optimization Algorithm for Optimized Circuit Design
| Sr. no. | Map | Fundamental mathematical form | Nomenclatures |
| 1 | Chebyshev | | p = Location/opted position in search space | 2 | Circle | | k = Iteration | a = 0.5 | b = 0.2 | 3 | Gauss/mouse | | R = Range for the position | | | 4 | Iterative | | λ = Parameter ranges from 0 to 1 | 5 | Logistic | | | 6 | Piecewise | | | 7 | Sine | | | 8 | Singer | | μ = Parameter count ranges from 0.9 to 1.08 | 9 | Sinusoidal | | a = 2.3 | | | | p0 = 0.7 | 10 | Tent | | |
|
|