没有合适的资源?快使用搜索试试~ 我知道了~
CEC2009测试基准函数详细定义
需积分: 5 2 下载量 60 浏览量
2023-11-30
19:59:21
上传
评论
收藏 2.7MB PDF 举报
温馨提示
试读
31页
CEC2009测试基准函数详细定义
资源推荐
资源详情
资源评论
See discussions, stats, and author profiles for this publication at: https://www.researchgate.net/publication/265432807
Multiobjective optimization Test Instances for the CEC 2009 Special Session and
Competition
ArticleinMechanical Engineering · January 2008
CITATIONS
1,000
READS
8,599
6 authors, including:
Qingfu Zhang
City University of Hong Kong
300 PUBLICATIONS30,241 CITATIONS
SEE PROFILE
Aimin Zhou
East China Normal University
111 PUBLICATIONS6,406 CITATIONS
SEE PROFILE
Ponnuthurai N. Suganthan
Qatar University
642 PUBLICATIONS59,535 CITATIONS
SEE PROFILE
All content following this page was uploaded by Ponnuthurai N. Suganthan on 15 January 2015.
The user has requested enhancement of the downloaded file.
1
Multiobjective optimization Test Instances for
the CEC 2009 Special Session and Competition
Qingfu Zhang
∗
, Aimin Zhou
∗
, Shizheng Zhao
†
, Ponnuthurai Nagaratnam Suganthan
†
, Wudong Liu
∗
and
Santosh Tiwari
‡
∗
Technical Report CES-487
The School of Computer Science and Electronic Engieering
University of Essex, Colchester, C04, 3SQ, UK
†
School of Electrical and Electronic Engineering
Nanyang Technological University, 50 Nanyang Avenue, Singapore
‡
Department of Mechanical Engineering
Clemson University, Clemson, SC 29634, US
April 20, 2009 DRAFT
2
I. INTRODUCTION
Due largely to the nature of multiobjective evolutionary algorithms (MOEAs), their behaviors and performances
are mainly studied experimentally. In the past 20 years, Several continuous multiobjective optimization problem
(MOP) test suites have been proposed the evolutionary computation community [1]-[9], which have played an crucial
role in developing and studying MOEAs. However, more test instances are needed to resemble complicated real-life
problems and thus stimulate the MOEA research. This report suggest a set of unconstrained (bound constrained)
MOP test instances and a set of general constrained test instances for the CEC09 algorithm contest. It also provides
performance assessment guidelines.
II. UNCONSTRAINED (BOUND CONSTRAINED) MOP TEST PROBLEMS
Unconstrained Problem 1 (F2 in [9])
The two objectives to be minimized:
f
1
= x
1
+
2
|J
1
|
X
j∈J
1
[x
j
− sin(6πx
1
+
jπ
n
)]
2
f
2
= 1 −
√
x
1
+
2
|J
2
|
X
j∈J
2
[x
j
− sin(6πx
1
+
jπ
n
)]
2
where J
1
= {j|j is odd and 2 ≤ j ≤ n} and J
2
= {j|j is even and 2 ≤ j ≤ n}.
The search space is [0, 1] ×[−1, 1]
n−1
.
Its PF is
f
2
= 1 −
p
f
1
, 0 ≤ f
1
≤ 1.
Its PS is
x
j
= sin(6πx
1
+
jπ
n
), j = 2, . . . , n, 0 ≤ x
1
≤ 1.
n = 30 in the CEC 09 algorithm contest.
Its PF and PS are illustrated in Fig. 1.
Unconstrained Problem 2 (F5 in [9])
The two objectives to be minimized:
f
1
= x
1
+
2
|J
1
|
X
j∈J
1
y
2
j
f
2
= 1 −
√
x
1
+
2
|J
2
|
X
j∈J
2
y
2
j
where J
1
= {j|j is odd and 2 ≤ j ≤ n}, J
2
= {j|j is even and 2 ≤ j ≤ n}, and
y
j
=
x
j
− [0.3x
2
1
cos(24πx
1
+
4jπ
n
) + 0.6x
1
] cos(6πx
1
+
jπ
n
) j ∈ J
1
x
j
− [0.3x
2
1
cos(24πx
1
+
4jπ
n
) + 0.6x
1
] sin(6πx
1
+
jπ
n
) j ∈ J
2
April 20, 2009 DRAFT
3
0.0 0.2 0.4 0,6 0.8 1.0 1.2
0.0
0.2
0.4
0,6
0.8
1.0
1.2
f1
f2
Pareto front
0
0.5
1
−1
0
1
−1
−0.5
0
0.5
1
x1
Pareto set
x2
x3
Fig. 1. Illustration of the PF and the PS of UF1.
Its search space is [0, 1] × [−1, 1]
n−1
.
Its PF is
f
2
= 1 −
p
f
1
, 0 ≤ f
1
≤ 1.
Its PS is
x
j
=
{0.3x
2
1
cos(24πx
1
+
4jπ
n
) + 0.6x
1
}cos(6πx
1
+
jπ
n
) j ∈ J
1
{0.3x
2
1
cos(24πx
1
+
4jπ
n
) + 0.6x
1
}sin(6πx
1
+
jπ
n
) j ∈ J
2
0 ≤ x
1
≤ 1.
n = 30 in the CEC 09 algorithm contest.
Its PF and PS are illustrated in Fig. 2.
0.0 0.2 0.4 0,6 0.8 1.0 1.2
0.0
0.2
0.4
0,6
0.8
1.0
1.2
f1
f2
Pareto front
0
0.5
1
−1
0
1
−1
−0.5
0
0.5
1
x1
Pareto set
x2
x3
Fig. 2. Illustration of the PF and the PS of UF2.
April 20, 2009 DRAFT
4
Unconstrained Problem 3 (F8 in [9])
The two objectives to be minimized:
f
1
= x
1
+
2
|J
1
|
(4
X
j∈J
1
y
2
j
− 2
Y
j∈J
1
cos(
20y
j
π
√
j
) + 2)
f
2
= 1
−
√
x
1
+
2
|J
2
|
(4
X
j∈J
2
y
2
j
−
2
Y
j∈J
2
cos(
20y
j
π
√
j
) + 2)
where J
1
and J
2
are the same as those of F1, and
y
j
= x
j
− x
0.5(1.0+
3(j−2)
n−2
)
1
, j = 2, . . . , n,
The search space is [0, 1]
n
Its PF is
f
2
= 1 −
p
f
1
, 0 ≤ f
1
≤ 1.
Its PS is
x
j
= x
0.5(1.0+
3(j−2)
n−2
)
1
, j = 2, . . . , n, 0 ≤ x
1
≤ 1.
n = 30 in the CEC 09 algorithm contest.
Its PF and PS are illustrated in Fig. 3.
0.0 0.2 0.4 0,6 0.8 1.0 1.2
0.0
0.2
0.4
0,6
0.8
1.0
1.2
f1
f2
Pareto front
0
0.5
1
0
0.5
1
0
0.2
0.4
0.6
0.8
1
x1
Pareto set
x2
x3
Fig. 3. Illustration of the PF and the PS of UF3.
Unconstrained Problem 4
The two objectives to be minimized:
f
1
= x
1
+
2
|J
1
|
X
j∈J
1
h(y
j
)
f
2
= 1 − x
2
1
+
2
|J
2
|
X
j∈J
2
h(y
j
)
April 20, 2009 DRAFT
剩余30页未读,继续阅读
资源评论
C厂工沛
- 粉丝: 309
- 资源: 12
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功