没有合适的资源?快使用搜索试试~ 我知道了~
CEC 2015 优化问题的测试函数
需积分: 50 41 下载量 137 浏览量
2019-02-18
21:57:07
上传
评论
收藏 3.28MB PDF 举报
温馨提示
试读
26页
CEC 2015 优化问题的常用测试函数。常用于验证智能优化方法的有效性。
资源推荐
资源详情
资源评论
Problem Definitions and Evaluation Criteria
for the CEC 2015 Competition on
Learning-based Real-Parameter Single Objective Optimization
J. J. Liang
1
, B. Y. Qu
2
, P. N. Suganthan
3
, Q. Chen
4
1
School of Electrical Engineering, Zhengzhou University, Zhengzhou, China
2
School of Electric and Information Engineering, Zhongyuan University of Technology, Zhengzhou, China
3
School of Electrical and Electronic Engineering, Nanyang Technological University, Singapore
4
Facility Design and Instrument Institute, China Aerodynamic Research and Development Center, China
liangjing@zzu.edu.cn
, qby1984@hotmail.com, epnsugan@ntu.edu.sg, chenqin1980@gmail.com
Technical Report 201411A, Computational Intelligence Laboratory,
Zhengzhou University, Zhengzhou China
And
Technical Report, Nanyang Technological University, Singapore
November 2014
CEC 2015 Competition on Learning-based Real-Parameter Single Objective Optimization
1
1. Introduction
Single objective optimization algorithms are the basis of the more complex optimization
algorithms such as multi-objective, niching, dynamic, constrained optimization algorithms
and so on. Research on single objective optimization algorithms influence the development
of the optimization branches mentioned above. In the recent years, various kinds of novel
optimization algorithms have been proposed to solve real-parameter optimization problems.
This special session is devoted to the approaches, algorithms and techniques for solving
real parameter single objective optimization without knowing the exact equations of the test
functions (i.e. blackbox optimization). We encourage all researchers to test their algorithms
on the CEC’15 test suites. The participants are required to send the final results(after
submitting their final paper version in March 2015)in the format specified in this technical
report to the organizers. The organizers will present an overall analysis and comparison
based on these results. We will also use statistical tests on convergence performance to
compare algorithms that eventually generate similar final solutions. Papers on novel
concepts that help us in understanding problem characteristics are also welcome.
Results of 10D and 30D problems are acceptable for the first review submission.
However, other dimensional results as specified in the technical report should also be
included in the final version, if space permits. Thus, final results for all dimensions in the
format introduced in the technical report should be zipped and sent to the organizers after the
final version of the paper is submitted.
Please note that in this competition error values smaller than 10
-8
will be taken as zero.
You can download the C, JAVA and Matlab codes for CEC’15 test suite from the
website given below:
http://www.ntu.edu.sg/home/EPNSugan/index_files/CEC2015/CEC2015.htm
This technical report presents the details of benchmark suite used for CEC’15
competition on learning based single objective global optimization.
CEC 2015 Competition on Learning-based Real-Parameter Single Objective Optimization
2
1.1 Introduction to Learning-Based Problems
As a relatively new solver for the optimization problems, evolutionary algorithm has
attracted the attention of researchers in various fields. When testing the performance of a
novel evolutionary algorithm, we always choose a group of benchmark functions and
compare the proposed new algorithm with other existing algorithms on these benchmark
functions. To obtain fair comparison results and to simplify the experiments, we always set
the parameters of the algorithms to be the same for all test functions. In general, specifying
different sets of parameters for different test functions is not allowed. Due to this approach,
we lose the opportunity to analyze how to adjust the algorithm to solve a specified problem
in the most effective manner. As we all know that there is no free lunch and for solving a
particular real-world problem, we only need one most effective algorithm. In practice, it is
hard to imagine a scenario whereby a researcher or engineer has to solve highly diverse
problems at the same time. In other words, a practicing engineer is more likely to solve
numerous instances of a particular problem. Under this consideration and by the fact that by
shifting the position of the optimum and mildly changing the rotation matrix will not change
the properties of the benchmark functions significantly, we propose a set of learning-based
benchmark problems. In this competition, the participants are allowed to optimize the
parameters of their proposed (hybrid) optimization algorithm for each problem. Although a
completely different optimization algorithm might be used for solving each of the 15
problems, this approach is strongly discouraged, as our objective is to develop a highly
tunable algorithm to solve diverse instances of real-world problems. In other words, our
objective is not to identify the best algorithms for solving each of the 15 synthetic
benchmark problems.
To test the generalization performance of the algorithm and associated parameters, the
competition has two stages:
Stage 1: Infinite instances of shifted optima and rotation matrixes can be generated. The
participants can optimize the parameters of their proposed algorithms for each problem with
these data and write the paper. Adaptive learning methods are also allowed.
CEC 2015 Competition on Learning-based Real-Parameter Single Objective Optimization
3
Stage 2: A different testing set of shifted optima and rotation matrices will be provided
to test the algorithms with the optimized parameters in Stage 1. The performance on the
testing set will be used for the final ranking.
1.2 Summary of the CEC’15 Learning-Based Benchmark Suite
TableI. Summary of the CEC’15 Learning-Based Benchmark Suite
No. Functions F
i
*=F
i
(x*)
Unimodal
Functions
1 Rotated High Conditioned Elliptic Function 100
2 Rotated Cigar Function 200
Simple
Multimodal
Functions
3 Shifted and Rotated Ackley’s Function 300
4 Shifted and Rotated Rastrigin’s Function 400
5 Shifted and Rotated Schwefel’s Function 500
Hybrid
Functions
6 Hybrid Function 1 (N=3) 600
7 Hybrid Function 2 (N=4) 700
8 Hybrid Function 3(N=5) 800
Composition
Functions
9 Composition Function 1 (N=3) 900
10 Composition Function 2 (N=3) 1000
11 Composition Function 3 (N=5) 1100
12 Composition Function 4 (N=5) 1200
13 Composition Function 5 (N=5) 1300
14 Composition Function 6 (N=7) 1400
15 Composition Function 7 (N=10) 1500
Search Range: [-100,100]
D
*Please Note:
1. These problems should be treated as black-box problems. The explicit equations of the
problems are not to be used.
2. These functions are with bounds constraints. Searching beyond the search range is not
allowed.
CEC 2015 Competition on Learning-based Real-Parameter Single Objective Optimization
4
1.3 Some Definitions:
All test functions are minimization problems defined as following:
Min f(x),
T
12
[ , ,..., ]
D
x
xxx
D: dimensions.
T
112
[ , ,..., ]
iii iD
oo oo
: the shifted global optimum (defined in “shift_data_x.txt”), which
is randomly distributed in [-80,80]
D
. Each function has a shift data for CEC’14.
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
.
M
i
: rotation matrix. Different rotation matrices are assigned to each function and each
basic function.
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.4 Definitions of the Basic Functions
1) High Conditioned Elliptic Function
1
62
1
1
1
() (10)
i
D
D
i
i
f
x
x
(1)
2) Cigar Function
262
21
2
() 10
D
i
i
f
xxx
(2)
3) Discus Function
62 2
31
2
() 10
D
i
i
f
xxx
(3)
剩余25页未读,继续阅读
资源评论
wangjiquanneau
- 粉丝: 0
- 资源: 2
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- IMG_20240425_120538.jpg
- My Complete Genome_6k Base-Pairs of Phenotype SNPs_Complete Raw Data.zip
- qt 的mqtt测试demo
- 移动应用开发教程-zip.zip
- mosquitto-2.018-install-windows-x64
- FTPServer FTP 服务器,绿色免安装,单文件
- 梦畅语音点名软件,上课点名
- 利用ADNI数据集和标签,在tensorflow框架上使用tensorlayer接口,通过架构u-net实现海马体的分割
- Kutools for Word v9.0 office word 插件
- 修复Windows 10 LTSC 2021资源占用率高
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功