Professional Documents
Culture Documents
1
School of EEE, Nanyang Technological University, Singapore
2
School of Computer Information Systems, Jordan University of Science and Technology, Jordan
3
School of Electrical Engineering, Zhengzhou University, Zhengzhou, China
noor0029@ntu.edu.sg, mzali.pn@ntu.edu.sg, epnsugan@ntu.edu.sg, liangjing@zzu.edu.cn
D: dimensions.
oi1 [oi1 , oi 2 ,..., oiD ]T : the shifted global optimum (defined in “shift_data_x.txt”), which is
randomly distributed in [-80,80]D. Different from CEC’13 and similar to CEC’14 each
function has a shift data for CEC’17.
All test functions are shifted to o and scalable.
For convenience, the same search ranges are defined for all test functions.
Search range: [-100,100]D.
Mi: rotation matrix. Different rotation matrix are assigned to each function and each basic
function.
Considering that in the real-world problems, it is seldom that there exist linkages among all
variables. In CEC’17, same as CEC’15 the variables are divided into subcomponents
randomly. The rotation matrix for each subcomponents are generated from standard
normally distributed entries by Gram-Schmidt ortho-normalization with condition number c
that is equal to 1 or 2.
1.2 Summary of the CEC’17 Test Suite
D i 1
f 2 ( x ) xi (2)
i 1
3) Zakharov Function
2 4
D
D D
f3 ( x ) x 0.5 xi 0.5 xi
2
i (3)
i 1 i 1 i 1
4) Rosenbrock’s Function
D 1
f 4 ( x ) (100( xi2 xi 1 )2 ( xi 1)2 ) (4)
i 1
5) Rastrigin’s Function
D
f5 ( x ) ( xi 2 10cos(2 xi ) 10) (5)
i 1
(sin 2 ( x 2 y 2 ) 0.5)
Schaffer’s F6 Function: g ( x, y ) 0.5
(1 0.001( x 2 y 2 ))2
02 d 1
0 2.5, 1 , s 1 ,d 1
s 2 D 20 8.2
10( x o)
y , xi 2sign( xi *) yi 0 , for i 1, 2,..., D
100
z 100 ( x 0 )
(7)
5.12( x o)
xi if xi 0.5
x M1 , yi for i 1, 2,..., D
100
round(2 xi ) / 2 if xi 0.5 (8)
z M1 M 2Tasy (Tosz ( y ))
10 0.2
i 1
Tosz: for xi sign( xi ) exp( xˆi 0.049(sin(c1 xˆi ) sin(c2 xˆi ))),for i 1 and D [4]
1 if xi 0
log( xi ) if xi 0
where xˆi , sign( xi ) 0 if xi 0
0 otherwise 1 otherwise
10 if xi 0 7.9 if xi 0
c1 , and c2
5.5 otherwise 3.1 otherwise
9) Levy Function
D 1
f9 ( x ) sin 2 ( w1 ) ( wi 1)2 1 10sin 2 (πwi 1) ( wD 1) 2 1 sin 2 (2 wD )
i 1
xi 1
Where wi 1 , i 1,..., D (9)
4
10) Modified Schwefel’s Function
D
f10 ( x ) 418.9829 D g ( zi ), zi xi +4.209687462275036e+002
i 1
zi sin( zi ) if zi 500
1/2
(10)
( z 500) 2
g ( zi ) (500 mod( zi ,500)) sin( 500 mod( zi ,500) ) i if zi 500
10000 D
( zi 500)2
(mod( z ,500) 500)sin( mod( z , 500) 500 ) if zi 500
i i
10000 D
1 D 2 1 D
f13 ( x ) 20exp(0.2 i
D i 1
x ) exp( cos(2πxi )) 20 e
D i 1
(13)
2
1 D 1
f 20 ( x ) si . sin 50.0s 1 , si xi2 xi21
0.2
(20)
D 1 i 1
i
A. Unimodal Functions:
F1 ( x) f1 (M( x o1 )) F1 * (21)
Properties:
Unimodal
Non-separable
Smooth but narrow ridge
F2 ( x) f 2 (M( x o2 )) F2 * (22)
Properties:
Unimodal
Non-separable
Symmetric
F3 ( x) f3 (M( x o3 )) F3 * (23)
2.048( x o4 )
F4 ( x ) f 4 (M( ) 1) F4 * (24)
100
F5 ( x) f5 (M( x o5 )) F5 * (25)
Figure 5(a). 3-D map for 2-D function
Properties:
Multi-modal
Non-separable
Local optima’s number is huge and second better local optimum is far from the
global optimum.
Properties:
Multi-modal
Non-separable
Asymmetrical
Local optima’s number is huge
600( x o7 )
F7 ( x ) f 7 (M( )) F7 * (27)
100
Figure 7(a). 3-D map for 2-D function
5.12( x o8 )
F8 ( x ) f8 ( ) F8 * (28)
100
Figure 8(a). 3-D map for 2-D function
Properties:
Multi-modal
Non-separable
Asymmetrical
Local optima’s number is huge
5.12( x o9 )
F9 ( x ) f9 (M( )) F9 * (29)
100
Figure 9(a). 3-D map for 2-D function
Properties:
Multi-modal
Non-separable
Local optima’s number is huge
1000( x o10 )
F10 ( x ) f10 ( ) F10 * (30)
100
Figure 10(a). 3-D map for 2-D function
Properties:
Multi-modal
Non-Separable
Local optima’s number is huge and second better local optimum is far from the
global optimum.
C. Hybrid Functions
Considering that in the real-world optimization problems, different subcomponents of the
variables may have different properties[5]. In this set of hybrid functions, the variables are
randomly divided into some subcomponents and then different basic functions are used for
different subcomponents.
F ( x) g1 (M1z1 ) g2 (M2 z2 ) ... g N (M N zN ) F * ( x) (31)
y x - oi , S randperm(1: D)
N
ni: dimension for each basic function n
i 1
i D
N 1
n1 p1 D , n2 p2 D ,..., nN 1 pN 1D , nN D ni
i 1
Properties:
Multi-modal or Unimodal, depending on the basic function
Non-separable subcomponents
Different properties for different variables subcomponents
D. Composition Functions
N
F ( x ) {i *[i gi ( x ) biasi ]} F * (32)
i 1
that gi(x)
i : used to control each gi(x)’s height
1
(x
j 1
j oij ) 2
wi exp( ) (33)
D 2 D i 2
(x
j 1
j oij ) 2
n
Then normalize the weight i wi / wi
i 1
1 j i
So when x oi , j for j 1, 2,..., N , f ( x) biasi f *
0 ji
The local optimum which has the smallest bias value is the global optimum. The
composition function merges the properties of the sub-functions better and maintains
continuity around the global/local optima.
Functions Fi’= Fi-Fi* are used as gi. In this way, the function values of global optima of gi
are equal to 0 for all composition functions in this report.
In CEC’14, the hybrid functions are also used as the basic functions for composition
functions (Composition Function 7 and Composition Function 8). With hybrid functions as
the basic functions, the composition function can have different properties for different
variables subcomponents.
Please Note: All the basic functions that have been used in composition functions are shifted
and rotated functions.
Properties:
Multi-modal
Non-separable
Asymmetrical
Different properties around different local optima
Properties:
Multi-modal
Non-separable
Asymmetrical
Different properties around different local optima
Different properties for different variables subcomponents
2. Evaluation Criteria
Fi ( x*) Fi (oi ) Fi *
Termination: Terminate when reaching MaxFES or the error value is smaller than 10-8.
1) Record function error value (Fi(x)-Fi(x*)) after (0.01, 0.02, 0.03, 0.05, 0.1, 0.2, 0.3,
0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1.0)*MaxFES for each run.
In this case, 14 error values are recorded for each function for each run. Sort the error
values achieved after MaxFES in 51 runs from the smallest (best) to the largest (worst)
and present the best, worst, mean, median and standard variance values of function
error values for the 51 runs.
Please Notice: Error value smaller than 10-8 will be taken as zero.
2) Performance Measure
a) The evaluation criteria will be divided into two parts:
1. 50% summation of error values for all dimensions
2. 50% rank based for each problem in each dimension
b) Higher weight will be given for higher dimensions
3) Algorithm Complexity
a) Run the test program below:
x= 0.55;
for i=1:1000000
x=x + x; x=x/2; x=x*x; x=sqrt(x); x=log(x); x=exp(x); x=x/(x+2);
end
Computing time for the above=T0;
b) Evaluate the computing time just for Function 18. For 200000 evaluations of a certain
dimension D, it gives T1;
c) The complete computing time for the algorithm with 200000 evaluations of the same D
dimensional Function 18 is T2.
4) Parameters
Participants must not search for a distinct set of parameters for each problem/dimension/etc.
Please provide details on the following whenever applicable:
a) All parameters to be adjusted
b) Corresponding dynamic ranges
c) Guidelines on how to adjust the parameters
d) Estimated cost of parameter tuning in terms of number of FEs
e) Actual parameter values used.
5) Encoding
If the algorithm requires encoding, then the encoding scheme should be independent of the
specific problems and governed by generic factors such as the search ranges.
6) Results Format
The participants are required to send the final results as the following format to the
organizers and the organizers will present an overall analysis and comparison based on
these results.
Create one txt document with the name “AlgorithmName_FunctionNo._D.txt” for each test
function and for each dimension.
For example, PSO results for test function 5 and D=30, the file name should be
“PSO_5_30.txt”.
Then save the results matrix (the gray shadowing part) as Table II in the file:
Table II. Information Matrix for D Dimensional Function X
***.txt Run 1 Run 2 … Run 51
Function error values when FES=0.01*MaxFES
Function error values when FES=0.02*MaxFES
Function error values when FES=0.03*MaxFES
Function error values when FES=0.05*MaxFES
……
Function error values when FES=0.9*MaxFES
Function error values when FES=MaxFES
Thus 30*4 (10D, 30D, 50D and 100D) files should be zipped and sent to the organizers.
Each file contains a 14*51 matrix.
Notice: All participants are allowed to improve their algorithms further after submitting
the initial version of their papers to CEC2014. And they are required to submit their results
in the introduced format to the organizers after submitting the final version of paper as soon
as possible.
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
Parameters
a) All parameters to be adjusted
b) Corresponding dynamic ranges
c) Guidelines on how to adjust the parameters
d) Estimated cost of parameter tuning in terms of number of FES
e) Actual parameter values used.
References
[1] P. N. Suganthan, N. Hansen, J. J. Liang, K. Deb, Y.-P. Chen, A. Auger & S. Tiwari,
"Problem Definitions and Evaluation Criteria for the CEC 2005 Special Session on
Real-Parameter Optimization," Technical Report, Nanyang Technological University,
Singapore, May 2005 and KanGAL Report #2005005, IIT Kanpur, India, 2005.
[2] J. J. Liang, B. Y. Qu, P. N. Suganthan, Alfredo G. Hernández-Díaz, "Problem
Definitions and Evaluation Criteria for the CEC 2013 Special Session and Competition
on Real-Parameter Optimization", Technical Report 201212, Computational Intelligence
Laboratory, Zhengzhou University, Zhengzhou China and Technical Report,
Nanyang Technological University, Singapore, January 2013.
[3] J. J. Liang, B. Y. Qu, P. N. Suganthan, "Problem Definitions and Evaluation Criteria for
the CEC 2014 Special Session and Competition on Real-Parameter Optimization",
Technical Report 201212, Computational Intelligence Laboratory, Zhengzhou
University, Zhengzhou China and Technical Report, Nanyang Technological
University, Singapore, January 2014.
[4] Joaqu´ın Derrac, Salvador Garcia, Sheldon Hui, Francisco Herrera , Ponnuthurai N.
Suganthan, "Statistical analysis of convergence performance throughout the search: A
case study with SaDE-MMTS and Sa-EPSDE-MMTS," accepted by Symp. DE 2013,
IEEE SSCI 2013, 2012.
[5] Xiaodong Li, Ke Tang, Mohammad N. Omidvar, Zhenyu Yang, and Kai Qin,
Benchmark Functions for the CEC’2013 Special Session and Competition on
Large-Scale Global Optimization, Technical Report, 2013.