Details for NCL-TR-2007012
PropertyValue
NameNCL-TR-2007012
Description
Benchmark Functions for the CEC’2008 Special Session and Competition on Large Scale Global Optimization
Tang, K., Yao, X., Suganthan, P. N., MacNish, C., Chen, Y.-p., Chen, C.-M., & Yang, Z.
Abstract: In the past two decades, different kinds of nature-inspired optimization algorithms have been designed and applied to solve optimization problems, e.g., simulated annealing (SA), evolutionary algorithms (EAs), differential evolution (DE), particle swarm optimization (PSO), Ant Colony Optimisation (ACO), Estimation of Distribution Algorithms (EDA), etc. Although these approaches have shown excellent search abilities when applying to some 30-100 dimensional problems, many of them suffer from the "curse of dimensionality", which implies that their performance deteriorates quickly as the dimensionality of search space increases. The reasons appear to be two-fold. First, complexity of the problem usually increases with the size of problem, and a previously successful search strategy may no longer be capable of finding the optimal solution. Second, the solution space of the problem increases exponentially with the problem size, and a more efficient search strategy is required to explore all the promising regions in a given time budget.
Historically, scaling EAs to large size problems have attracted much interest, including both theoretical and practical studies. The earliest practical approach might be the parallelism of an existing EA. Later, cooperative coevolution appears to be another promising method. However, existing work on this topic are often limited to the test problems used in individual studies, and a systematic evaluation platform is not available in the literature for comparing the scalability of different EAs.
In this report, 6 benchmark functions are given based on [1] and [2] for high-dimensional optimization. All of them are scalable for any size of dimension. The codes in Matlab and C for them are available at http://nical.ustc.edu.cn/cec08ss.php. The other benchmark function (Function 7 - FastFractal "DoubleDip") is generated based on [3] [4]. The C code for function 7 has been contributed by Ales Zamuda from the University of Maribor, Slovenia. It uses the GJC / CNI interface to run the Java code from C++. In the package, C code is provided in a separate zip file, named "cec08-f7-cpp.zip".
The mathematical formulas and properties of these functions are described in Section 2, and the evaluation criteria are given in Section 3.
FilenameNCL-TR-2007012.pdf
Filesize375.43 kB
Filetypepdf (Mime Type: application/pdf)
Creatorypchen
Created On: 12/15/2007 17:19
ViewersEverybody
Maintained byPublisher
Hits7316 Hits
Last updated on 12/09/2010 14:45
Homepage