.png){kind=icon}
返回
A local exploration-based differential evolution algorithm for constrained global optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2008.11.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We propose a modified differential evolution ( DE) algorithm for constrained global optimization. The modi. cation is based on the mutation rule of DE. The new algorithm also incorporates a periodic local exploration technique. The local technique used is a 'limited' version of the pattern search ( PS) method. The penalty functions such as the superiority of feasible points (SFP) and the parameter free penalty (PFP) are used for handling constraints. We numerically study SFP and PFP and based on a drawback observed, we adapt the selection rule of DE. The new algorithm is tested on 45 test problems. Comparisons are made with some recent algorithms. (C) 2008 Elsevier Inc. All rights reserved.
Keyword:
Constrained global optimization
Differential evolution
Pattern search
Penalty functions
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
引用论文
分享收藏Optimization by direct search: New perspectives on some classical and modern methods.png)
SIAM REVIEW
OAAI
SIAM REVIEWIF6.1
OAAI分享收藏
查看更多内容