Research Article

A Chaotic Multi-Objective Runge–Kutta Optimization Algorithm for Optimized Circuit Design

Table 4

Comparison results of the 10 chaotic maps using 15 benchmark test functions.

FUNCTIONChebyshevCircleGaussIterativeLogisticPiecewiseSineSingerSinuisodalTent

F12.14E-032.70E-041.14E-032.00E-057.16E-034.20E-045.00E-044.03E-034.03E-038.10E-04
F2−4.00E + 07−4.00E + 07−4.00E + 074.00E + 074.00E + 074.00E + 07−4.00E + 07−4.00E + 07−4.00E + 07−4.00E + 07
F3−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.40E + 01−1.39E + 01
F41.52E + 011.50E + 011.50E + 011.51E + 011.52E + 011.51E + 011.52E + 011.52E + 011.51E + 011.52E + 01
F50.00E + 000.00E + 000.00E + 000.00E + 000.00E + 000.00E + 000.00E + 000.00E + 000.00E + 000.00E + 00
F6−7.89E + 03−6.41E + 03−4.39E + 03−2.79E + 03−2.84E + 03−4.14E + 03−3.27E + 03−2.58E + 03−4.28E + 03−6.13E + 03
F7−1.55E + 02−1.39E + 02−1.59E + 02−1.37E + 02−1.12E + 02−9.79E + 01−1.28E + 02−1.11E + 02−1.32E + 02−1.02E + 02
F81.85E + 022.01E + 021.68E + 022.06E + 022.03E + 022.06E + 022.06E + 022.03E + 021.90E + 022.02E + 02
F97.15E-016.36E-018.48E-017.24E-016.81E-018.07E-016.05E-017.67E-016.55E-016.79E-01
F108.26E + 008.25E + 008.22E + 008.27E + 008.21E + 008.25E + 008.17E + 008.29E + 008.25E + 008.36E + 00
F11−1.06E + 07−1.04E + 07−1.06E + 07−1.05E + 07−1.08E + 06−1.09E + 06−1.03E + 06−1.03E + 06−1.05E + 06−1.09E + 06
F12−5.03E + 05−4.98E + 05−4.72E + 05−4.82E + 05−4.95E + 05−4.84E + 05−4.86E + 05−5.01E + 05−5.02E + 05−4.93E + 05
F13−4.96E + 05−4.80E + 05−4.82E + 05−4.73E + 05−4.81E + 05−4.80E + 05−4.81E + 05−4.90E + 05−5.01E + 05−4.87E + 05
F14−3.70E + 01−3.71E + 01−3.70E + 01−3.68E + 01−3.65E + 01−3.65E + 01−3.59E + 013.64E + 01−3.60E + 013.68E + 01
F15−6.10E-04−6.10E-04−1.47E-03−5.00E-04−7.00E-04−2.50E-04−4.70E-04−1.07E-031.00E-02−5.80E-04

Bold values are the best results obtained for each function.