arrow
返回

Using variable reduction strategy to accelerate evolutionary optimization

delete2017-12-01
delete29
PRE
AI
G
Guohua Wu
W
Witold Pedrycz
P
Ponnuthurai Nagaratnam Suganthan
H
Haifeng Li *
DOI:10.1016/j.asoc.2017.08.012delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
In this study, we introduce a novel approach of variable reduction and integrate it into evolutionary algorithms in order to reduce the complexity of optimization problems. We develop reduction processes of variable reduction for derivative unconstrained optimization problems (DUOPs) and constrained optimization problems (COPs) with equality constraints and active inequality constraints. Variable reduction uses the problem domain knowledge implied when investigating optimal conditions existing in optimization problems. For DUOPs, equations involving derivatives are considered while for COPs, we discuss equations expressing the equality constraints. From the relationships formed in this way, we obtain relationships among the variables that have to be satisfied by optimal solutions. According to such relationships, we can utilize some variables (referred to as core variables) to express some other variables (referred to as reduced variables). We show that the essence of variable reduction is to produce a minimum collection of core variables and a maximum number of reduced variables based on a system of equations. We summarize some application-oriented situations of variable reduction and stress several important issues related to the further application and development of variable reduction. Essentially, variable reduction can reduce the number of variables and eliminate equality constraints, thus reducing the dimensionality of the solution space and improving the efficiency of evolutionary algorithms. The approach can be applied to unconstrained, constrained, continuous and discrete optimization problems only if there are explicit variable relationships to be satisfied in the optimal conditions. We test variable reduction on real-world and synthesized DUOPs and COPs. Experimental results and comparative studies point at the effectiveness of variable reduction. (C) 2017 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary computations
Unconstrained optimization
Constrained optimization
Variable reduction
Complexity reduction
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

C
Central South University
学者数:
10.0W
论文数: 7.2W
被引数: 10.9W
U
university of alberta
学者数:
5.1W
论文数: 4.9W
被引数: 65
N
Nanyang Technological University
学者数:
4.9W
论文数: 4.8W
被引数: 8.1W
F
Foshan University
学者数:
5.4K
论文数: 3.9K
被引数: 3
学者 查看更多机构
引用论文

引用论文

Sinigrin Enhanced Antiasthmatic Effects of Beta Adrenergic Receptors Agonists by Regulating cAMP-Mediated Pathways
err2020-05-20
err0
errOAAI
errSimeng Chu; Wenjuan Liu; Yujie Lu; Menglin Yan; Yingying Guo; Nianwei Chang; Min Jiang; Gang Bai
err分享
err收藏
Second harmonic generation in 2D layered materials
err2020-09-30
err0
PREAI
errJiantian Zhang; Weina Zhao; Peng Yu; Guowei Yang; Zheng Liu
err分享
err收藏
err2013-12-01
err0
errOAAI
err
err分享
err收藏
Efficient constraint handling for optimal reactive power dispatch problems
err2012-08-01
err102
PREAI
errMallipeddi, R.; Jeyadevi, S.; Suganthan, P. N.; Baskar, S.
err分享
err收藏
学者 查看更多内容