References

* Variable Global Optimal values

Test Problem n Objective function
bounds Minimum (fmin) of x
n−1
x i=0 , Akojwar &
f ( x i∨i=1 ,n ) =∑ ( x i2 + x i+12 )
0.25
F10 function 30 [-100,100] ¿¿ 0 Kshirsagar (2016)
i=1 i=1 , ..n
Regis &
Ackley’s x i=0 , i=1 ,.. n Shoemaker (2004)
30 [-32, 32] f ( x )=−20 exp ⁡¿ 0
Function Tumuluru &
McCulloch (2016)
n Noel (2012)
Rastrigin [-5.12,
30 f ( x )=10 n+ ∑ ¿ ¿ 0 x i=0 , i=1 ,.. n Jiang et al. (2019)
function 5.12] i=1

Riget &
n
x n Vesterstrøm (2002)
Griewank [-600, 1
function
30
600]
f ( x )=1+ ∑
4000 i=1
x i2−∏ cos ⁡( i )
√i
0 x i=0 , i=1 ,.. n Hussain et al.
i=1 (2017)

n−1 Liang et al. (2006)

Rosenbrock [-5.12,
30 f ( x )=∑ [100 ( x i+1−x i 2 2
) 2
+( xi −1) ¿ ]¿ 0 x i=1 ,i=1, .. n Noel (2012)
function 5.12] i=1

Liang et al. (2006)

n Hussain et al.
Sphere [-6.12,
30 f ( x )=∑ xi2 0 x i=0 , i=1 ,.. n (2017)
Function 6.12] i=1

Molga &
n
x i=420.9687 , Smutnicki (2005)
Schwefel 30 [-500,500] f ( x )=∑ −xi sin ¿ ¿ -418.9829n Liang et al. (2006)
i=1 i=1 , ..n
 ( √| |)
Forbes & Teli
x1
Eggholder
function
2
[-512,
512]
f ( x )=−( x 2+ 47 ) sin x2 + +47 −x 1 sin ( | x1 −( x 2+ 47 )|)
2 √ -959.64
x 1=512
x 2=404.2319
(2006)
Czerniak &
Zarzycki (2017)
Stuckman &
x 1=π Easom (1992)
Easom f ( x )=−cos ( x 1 ) cos ( x 2 ) exp ⁡¿)
2 [100,100] -1 Czerniak &
function x 2=π
Zarzycki (2017)

n Cox et al. (2001)

[-1.28,
Quartic 30 f ( x )=∑ i x i4 0 x i=0 , i=1 ,.. n Hussain et al.
1.28] i=1 (2017)
n
Erol & Eksin
Step 30 [-100,100] f ( x )=∑ (x i +0.5)2 0 x i=0.5 , i=1 ,.. n
i=1 (2006)

Hussain et al.
n n
Schewefel (2017)
30 [-10,10] f ( x )=∑ |x i|+ ∏ |x i| 0 x i=0 , i=1 ,.. n
2.22 i=1 i=1 Hannan et al.
(2020)
Obagbuwa et al.
n
(2014)
SumSquare 30 [-10, 10] f ( x )=∑ i x i2 0 x i=0 , i=1 ,.. n
i=1 Zhang et al. (2020)

n (i −1) Hussain et al.

[-100,
Elliptic 30 f ( x )=∑ ( 106 ) (n−1 ) x i2 0 x i=0 , i=1 ,.. n (2017)
100] i=1

x 1=2.2 Hussain et al.

[ ( )]
20
2
n
i xi x 2=1.57 (2017)
Michalewicz 2 [0 , π ] f ( x )=−∑ sin ( x i ) sin -1.8013
i=1 π
 { }
n−1 n
π
f (x)= 10 sin2 (¿ π y 1)+ ∑ ( y i−1)2 [ 1+10 sin 2 ( π y i+1 ) ] +( y n−1)2 + ∑ u i Niu et al. (2015)
D i=1 i =1
Hussain et al.
(2017)

{
100 ( x i−10 )4 x i> 10
Penalized 1 30 [-50,50] ui = 0 10 ≤ x i ≤10 0 x i=1 ,i=1, .. n
100(−xi −10) 4 x i ←10

y=1+ ¿

x i=0 , i=1 ,.. n Hsieh et al. (2008)

n
a=0.5 , Muthiah-Nakarajan
Weierstrass** 30 [-0.5, 0.5] f ( x )=∑ ¿ ¿ 0
i=1 b=0.3 , & Noel (2016)
k =20
n
Liang et al. (2016)
f ( x )=∑ ( y i2−10 cos ( 2 π y i ) +10 )
i=1
Non-
[-5.12,

{
continuous 30 0 x i=0 , i=1 ,.. n
5.12] x i if |x i|< 0.5 ,
Rastrigin
y i= round(2 x i)
else|x i|≥ 0.5
2
n Wang et al. (2013)
Schwefel [-500,
30 f ( x )=−418.98288727243369 x n+ ∑ ¿ ¿ 0 x i=0 , i=1 ,.. n Hussain et al.
2.26 500] i=1 (2017)
Yang et al. (2007)
Schaffer F6 2 [100, 100] sin2 ( √ x 12 + x 22)−0.5 0
x 1=0
Erkan et al. (2023)
f ( x )=0.5+ x 2=0
¿¿¿
n−1 Hussain et al.
Alpine 30 [-10, 10] f ( x )=∑ |x 1 sin ( x i ) +0.1 x i| 0 x i=0 , i=1 ,.. n (2017)
i=1

Booth’s 2 [-10, 10] 2

f ( x )=(x 1+ 2 x 2−7) +(2 x 1 + x 2−5)
2
0 x 1=1 Balasubbareddy
Function (2016)
 x 2=3 Mallala et al.
(2022)
Solteiro et al.
[-5.12, −1+cos ⁡(12 √ x12 + x 22) x 1=0 (2010)
Drop wave 2 f ( x )= -1
5.12] 0.5 ( x12 + x 22) +2 x 2=0 Li et al. (2021)

Stuckman &
Shubert 5 5
[-5.12, 18 global Easom (1992)
Function 2 f ( x )=∑ i. cos ⁡((i+1) ¿ x1 +i)∗∑ i . cos ⁡( (i+1 ) x 2+i)¿ -186.73
5.12] i=1 i=1 minimum İlhan (2016)

x 1 ∈ [−3 ,3 ] Kleijnen (2012)

Six Hump
( )
4
x 2 ∈ [−2, 2 ] x1 x 1=−0.0898 Lee et al. (2017)
x + x 1 x2 + ( −4 +4 x 2 ) x 2
2 2 2 2
Camel Back 2 f ( x )= 4−2.1 x 1 + -1.0316
3 1 x 2=0.7126
Function

| (| |)|
İlhan (2016)
Holder Table
2 [-10, 10] f ( x )=− sin ( x 1 ) cos ( x 2 ) exp 1−
√x 1
2
+ x2
2
-19.21
x 1=8.055
Harifi (2021)
function π x 2=9.664
x 1 ∈[−15 ,−5 ] Bozorg-Haddad
Bukin x 1=−10
Function
2 x 2 ∈[−3 , 3] √
f ( x )=100 |x 2−0.01 x 1 |+ 0.01| x1 +10| 2
0
x 2=1
(2015)

2 2
f 1 ( x )=x 1 + 2 x 2 −0.3 cos ( 3 π x 1 )−0.4 cos ( 4 π x 2 ) +0.7 Demo et al. (2021)
Bohachevsky
2 2
f 2 ( x )=x 1 +2 x 2 −0.3 cos ( 3 π x 1 ) cos ( 4 π x 2 ) +0.3 x 1=0
2 [-100,100] 0
Functions 2 2
f 3 ( x )=x 1 +2 x 2 −0.3 cos ( 3 π x 1 +4 π x 2 ) +0.3 x 2=0

[ ]
Kowalik 4 [-5,5] 11
x 1 ( bi + bi x2 )
2
2
0.00031 a=¿[0.1957,
f ( x ) = ∑ ai − 2
0.1947, 0.1735, Jamil et al. (2013)
i=1 b i + bi x 3 + x 4 0.1600, 0.0844, Kaboli et al. (2017)
0.0627, 0.045, Akyol (2023)
0.0342, 0.0323,
0.0235, 0.0246]
 b=¿
1 1 1
, , ,
6 8 10
1 1 1
, , ¿
12 14 16

x 1=0.192
x 2=0.190
x 3=0 .123
x 4 =0.135
Kaboli et al. (2017)
Goldstein-
2 [-2,2] [ 2
]
f ( x )= 1+ ( x 1+ x 2 +1 ) ( 19−14 x 1+3 x 1 −14 x 2 +6 x 1 x 2+ 3 x 2 ) × ¿
2 2
3 [0, -1]
Prince
3
Zhang et al. (2020)
f ( x )=−∑ c i exp ⁡¿ ¿ Yu et al. (2022)
i=1
T
c i=(1.0 ,1.2 , 3.0 , 3.2)

( )
3.0 10 30
a= 0.1 10 35
[0.114614,
Hartman 3.0 10 30
3 [0,1] -3.86 0.555649,
3D*** 0.1 10 35
0.852547]

( )
3689 1170 2673
p= 4699 4387 7470
1091 8732 5547
381 5743 8828
 4
Queipo et al.
f ( x )=−∑ c i exp ¿ ] (2013)
i=1
Zhang et al. (2020)
T
c i=(1.0 ,1.2 , 3.0 , 3.2)

( )
10 3 17 3.5 1.7 8 [0.20169,
0.05 10 17 0.1 8 14 0.150011,
a=
Hartman 3 3.5 1.7 10 17 8 0.476874,
6 [0,1] -3.32
6D*** 17 8 0.05 10 0.1 14 0.275332,
0.311652,0.6573

( )
1312 1696 5569 124 8283 5586 ]
−4 2329 4135 8307 3736 1004 9991
p=10
2348 1451 3522 2883 3047 6650
4047 8828 8732 5743 1091 381

m
Kaboli et al. (2017)
f ( x )=∑ ¿ ¿ ¿
i=1
m=10
1 T
β= (1, 2 , 2, 4 , 4 , 6 , 3 , 7 , 5 ,5)
10

( )
Shekel**** 4 [0,10] 4.0 1.0 8.0 6.0 3.0 2.0 5.0 8.0 6.0 7.0 -10.5364 [4,4,4,4]
4.0 1.0 8.0 6.0 7.0 9.0 3.0 1.0 2.0 3.6
C=
4.0 1.0 8.0 6.0 3.0 2.0 5.0 8.0 6.0 7.0
4.0 1.0 8.0 6.0 7.0 9.0 3.0 1.0 2.0 3.6

Colville 4 [-10,10] f ( x )=100 (x 12 −x2 )2+(x 1−1)2+(x 3−1)2+ 90(x 32−x 4 )2+ 10.1 ( ( x 2−1 )2 + ( x 4−1
0 ) ) +19.8(x 2−1)(x
2
4 −1)
[1,1,1,1] Khompatraporn et
 al. (2005)
Solteiro et al.
Function
(2010)

Kamsing et al.
Matyas
2 [-10,10] f ( x )=0.26 ( x 12+ x 22 ) −0.48 x1 x 2 0 [0,0] (2020)
Function
f 1 ( x )=x 1 Zitzeler et al.

√[ ]
x1 (1999)
f 2 ( x )=g ( x ) {1− } Convex Pareto Front Yang & He (2013)
ZDT1 30 [0,1] g (x )
n
g ( x )=1+9( ∑ xi )/(n−1)
i=2

f 1 ( x )=x 1 Zitzeler et al.

[ ]
x1
2 (1999)
f 2 ( x )=g ( x ) {1− } Non-Convex Pareto Front Yang & Deb (2013)
g(x)
ZDT2 30 [0,1] n
g ( x )=1+9( ∑ xi )/(n−1)
i=2

f 1 ( x )=x 1 Convex- disconnected Zitzeler et al.

√[ ] [ ]
x1 x1 Pareto Front (1999)
f 2 ( x )=g ( x ) {1− − sin ( 10 π x 1) } Morgan et al.
ZDT3 30 [0,1] g (x ) g(x) (2016)
n
g ( x )=1+9( ∑ xi )/(n−1)
i=2

ZDT4 10 x1 ϵ [ 0 , 1] f 1 ( x )=x 1 Zitzeler et al.

(1999)
 √[ ] x1 Non-Convex Pareto Front Peng et al. (2016)
f 2 ( x )=g ( x ) {1− }
g (x )
x i ϵ [ −5 , 5 ] , i=2 , … n n
g ( x )=1+10 ( n−1 )+ ∑ [ x i2 −10 cos ( 4 π x i ) ]
i=2

6
f 1 ( x )=1−exp ⁡( −4 x 1) sin (6 π x 1) Non-convex, Zitzeler et al.

{ [ ]}
2 Nonuniformly spaced (1999)
f 1 (x ) Pareto Front Reddy & Kumar
ZDT6 10 [0,1] f 2 ( x )=g ( x ) 1−
g(x) (2007)
g ( x )=1+9 ¿ ¿
f 1 ( x )=1−exp ⁡¿ Fonseca (1998)
f 2 ( x )=1−exp ⁡¿ Reddy and Kumar
Fonseca 3 [-4,4] Non-Convex Pareto Front
(2007)

Reddy & Kumar

f 1 ( x )=x
2 (2007)
SCH1 1 [-103,103] 2 Convex Pareto Front Tripathy et al.
f 2 ( x )=(x−2) (2007)

*
n denotes the number of variables or dimensions in the optimization problem.
**
a ,b, and K are the constants that controls the oscillations and scaling of the Weierstrass test function.
*** a ij∧ p ij are the constants that define the shape and location of the Hartmann test function; c i are the weighting coefficients.
**** C ji and β iare the constants that define the shape of shekel test function

f ( x ) is the objective function of the optimization problem.

x i are the individual decision variables of the problem.
References:

1. Akojwar, S. G., & Kshirsagar, P. R. (2016). Performance evolution of optimization techniques for mathematical benchmark
functions. International Journal of Computers, 1,231-236.
2. Akyol, S. (2023). A new hybrid method based on Aquila optimizer and tangent search algorithm for global optimization. Journal of
Ambient Intelligence and Humanized Computing, 14(6), 8045-8065.
3. Balasubbareddy, M. (2016). Multi-objective optimization in the presence of ramp-rate limits using non-dominated sorting hybrid fruit fly
algorithm. Ain Shams Engineering Journal, 7(2), 895-905.
4. Bozorg-Haddad, O., Karimirad, I., Seifollahi-Aghmiuni, S., & Loáiciga, H. A. (2015). Development and application of the bat algorithm
for optimizing the operation of reservoir systems. Journal of Water Resources Planning and Management, 141(8), 04014097.
5. Cox, S. E., Haftka, R. T., Baker, C. A., Grossman, B., Mason, W. H., & Watson, L. T. (2001). A comparison of global optimization
methods for the design of a high-speed civil transport. Journal of Global Optimization, 21, 415-432.
6. Czerniak, J. M., & Zarzycki, H. (2017). Artificial acari optimization as a new strategy for global optimization of multimodal
functions. Journal of computational science, 22, 209-227.
7. Demo, N., Tezzele, M., & Rozza, G. (2021). A supervised learning approach involving active subspaces for an efficient genetic algorithm
in high-dimensional optimization problems. SIAM Journal on Scientific Computing, 43(3), B831-B853.
8. Elbeltagi, E., Hegazy, T., & Grierson, D. (2005). Comparison among five evolutionary-based optimization algorithms. Advanced
engineering informatics, 19(1), 43-53.
9. Erkan, U., Toktas, A., & Lai, Q. (2023). 2D hyperchaotic system based on Schaffer function for image encryption. Expert Systems with
Applications, 213, 119076.
10. Erol, O. K., & Eksin, I. (2006). A new optimization method: big bang–big crunch. Advances in engineering software, 37(2), 106-111.
11. Fonseca, C. M., & Fleming, P. J. (1998). Multiobjective optimization and multiple constraint handling with evolutionary algorithms. I. A
unified formulation. IEEE Transactions on Systems, Man, and Cybernetics-Part A: Systems and Humans, 28(1), 26-37.
12. Forbes, R., & Teli, M. N. (2006). Particle swarm optimization on multi-funnel functions. Computer aided optimum design in engineering
XII, 255.
13. Hannan, M. A., Ali, J. A., Hossain Lipu, M. S., Mohamed, A., Ker, P. J., Indra Mahlia, T. M., ... & Dong, Z. Y. (2020). Role of
optimization algorithms based fuzzy controller in achieving induction motor performance enhancement. Nature communications, 11(1),
3792.
14. Harifi, S., Mohammadzadeh, J., Khalilian, M., & Ebrahimnejad, S. (2021). Giza Pyramids Construction: an ancient-inspired
metaheuristic algorithm for optimization. Evolutionary Intelligence, 14, 1743-1761.
15. Hsieh, S. T., Sun, T. Y., Liu, C. C., & Tsai, S. J. (2008). Efficient population utilization strategy for particle swarm optimizer. IEEE
Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 39(2), 444-456.
16. Hussain, K., Salleh, M. N. M., Cheng, S., & Naseem, R. (2017). Common benchmark functions for metaheuristic evaluation: A
review. JOIV: International Journal on Informatics Visualization, 1(4-2), 218-223.
17. İlhan, İ. (2016). Mobile device-based test tool for optimization algorithms. Computer Applications in Engineering Education, 24(5), 744-
754.
18. Jamil, M., Yang, X. S., & Zepernick, H. J. (2013). Test functions for global optimization: a comprehensive survey. Swarm intelligence
and Bio-inspired Computation, 193-222.
19. Janga Reddy, M., & Nagesh Kumar, D. (2007). An efficient multi-objective optimization algorithm based on swarm intelligence for
engineering design. Engineering Optimization, 39(1), 49-68.
20. Jiang, F., Zhang, Y., Zhang, Y., Liu, X., & Chen, C. (2019). An adaptive particle swarm optimization algorithm based on guiding strategy
and its application in reactive power optimization. Energies, 12(9), 1690.
21. Kaboli, S. H. A., Selvaraj, J., & Rahim, N. A. (2017). Rain-fall optimization algorithm: A population-based algorithm for solving
constrained optimization problems. Journal of Computational Science, 19, 31-42.
22. Kamsing, P., Torteeka, P., & Yooyen, S. (2020). An enhanced learning algorithm with a particle filter-based gradient descent optimizer
method. Neural Computing and Applications, 32, 12789-12800.
23. Khompatraporn, C., Pintér, J. D., & Zabinsky, Z. B. (2005). Comparative assessment of algorithms and software for global
optimization. Journal of global optimization, 31, 613-633.
24. Kleijnen, J. P., Van Beers, W., & Van Nieuwenhuyse, I. (2012). Expected improvement in efficient global optimization through
bootstrapped kriging. Journal of global optimization, 54, 59-73.
25. Lee, J. H., Song, J. Y., Kim, D. W., Kim, J. W., Kim, Y. J., & Jung, S. Y. (2017). Particle swarm optimization algorithm with intelligent
particle number control for optimal design of electric machines. IEEE Transactions on Industrial Electronics, 65(2), 1791-1798.
26. Li, M. W., Wang, Y. T., Geng, J., & Hong, W. C. (2021). Chaos cloud quantum bat hybrid optimization algorithm. Nonlinear
Dynamics, 103, 1167-1193.
27. Liang, J. J., Qin, A. K., Suganthan, P. N., & Baskar, S. (2006). Comprehensive learning particle swarm optimizer for global optimization
of multimodal functions. IEEE transactions on evolutionary computation, 10(3), 281-295.
28. Mallala, B., Papana, V. P., Sangu, R., Palle, K., & Chinthalacheruvu, V. K. R. (2022). Multi-objective optimal power flow solution using
a non-dominated sorting hybrid fruit fly-based artificial bee colony. Energies, 15(11), 4063.
29. Molga, M., & Smutnicki, C. (2005). Test functions for optimization needs. Test functions for optimization needs, 101, 48.
30. Morgan, M., Abdullah, N. R. H., Sulaiman, M. H., Mustafa, M., & Samad, R. (2016). Benchmark studies on optimal reactive power
dispatch (ORPD) based multi-objective evolutionary programming (MOEP) using mutation based on adaptive mutation operator (AMO)
and polynomial mutation operator (PMO). Journal of electrical systems, 12(1), 121-132.
31. Muthiah-Nakarajan, V., & Noel, M. M. (2016). Galactic swarm optimization: a new global optimization metaheuristic inspired by
galactic motion. Applied Soft Computing, 38, 771-787.
32. Niu, J., Zhong, W., Liang, Y., Luo, N., & Qian, F. (2015). Fruit fly optimization algorithm based on differential evolution and its
application on gasification process operation optimization. Knowledge-Based Systems, 88, 253-263.
33. Noel, M. M. (2012). A new gradient based particle swarm optimization algorithm for accurate computation of global minimum. Applied
Soft Computing, 12(1), 353-359.
34. Obagbuwa, I. C., Adewumi, A. O., & Adebiyi, A. A. (2014). Stochastic constriction cockroach swarm optimization for multidimensional
space function problems. Mathematical Problems in Engineering, 2014.
35. Peng, G., Fang, Y. W., Peng, W. S., Chai, D., & Xu, Y. (2016). Multi-objective particle optimization algorithm based on sharing–learning
and dynamic crowding distance. Optik, 127(12), 5013-5020.
36. Queipo, N. V., Pintos, S., & Nava, E. (2013). Setting targets for surrogate-based optimization. Journal of Global Optimization, 55, 857-
875.
37. Regis, R. G., & Shoemaker, C. A. (2004). Local function approximation in evolutionary algorithms for the optimization of costly
functions. IEEE transactions on evolutionary computation, 8(5), 490-505.
38. Riget, J., & Vesterstrøm, J. S. (2002). A diversity-guided particle swarm optimizer-the ARPSO. Dept. Comput. Sci., Univ. of Aarhus,
Aarhus, Denmark, Tech. Rep, 2, 2002.
39. Solteiro Pires, E. J., Tenreiro Machado, J. A., de Moura Oliveira, P. B., Boaventura Cunha, J., & Mendes, L. (2010). Particle swarm
optimization with fractional-order velocity. Nonlinear Dynamics, 61, 295-301.
40. Stuckman, B. E., & Easom, E. E. (1992). A comparison of bayesian/sampling global optimization techniques. IEEE Transactions on
Systems, Man, and Cybernetics, 22(5), 1024-1032.
41. Tripathi, P. K., Bandyopadhyay, S., & Pal, S. K. (2007). Multi-objective particle swarm optimization with time variant inertia and
acceleration coefficients. Information sciences, 177(22), 5033-5049.
42. Tumuluru, J. S., & McCulloch, R. (2016). Application of hybrid genetic algorithm routine in optimizing food and bioengineering
processes. Foods, 5(4), 76.
43. Wang, G., Guo, L., Duan, H., Wang, H., Liu, L., & Shao, M. (2013). Hybridizing harmony search with biogeography based optimization
for global numerical optimization. Journal of Computational and Theoretical Nanoscience, 10(10), 2312-2322.
44. Yang, X. S., & Deb, S. (2013). Multiobjective cuckoo search for design optimization. Computers & Operations Research, 40(6), 1616-
1624.
45. Yang, X. S., Karamanoglu, M., & He, X. (2013). Multi-objective flower algorithm for optimization. Procedia Computer Science, 18,
861-868.
46. Yang, X., Yuan, J., Yuan, J., & Mao, H. (2007). A modified particle swarm optimizer with dynamic adaptation. Applied mathematics and
computation, 189(2), 1205-1213.
47. Yu, C., Cao, J., & Rosendo, A. (2022). Learning to Climb: Constrained Contextual Bayesian Optimisation on a Multi-Modal Legged
Robot. IEEE Robotics and Automation Letters, 7(4), 9881-9888.
48. Zhang, M., Long, D., Qin, T., & Yang, J. (2020). A chaotic hybrid butterfly optimization algorithm with particle swarm optimization for
high-dimensional optimization problems. Symmetry, 12(11), 1800.
49. Zhang, Y., Kim, N. H., & Haftka, R. T. (2020). General-surrogate adaptive sampling using interquartile range for design space
exploration. Journal of Mechanical Design, 142(5), 051402.
50. Zitzler, E., Deb, K., & Thiele, L. (1999). Comparison of multiobjective evolutionary algorithms: Empirical results (revised version). TIK
Report, 70.