.png){kind=icon}
返回
Enhancing Differential Evolution Utilizing Proximity-Based Mutation Operators
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2010.2083670.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Differential evolution is a very popular optimization algorithm and considerable research has been devoted to the development of efficient search operators. Motivated by the different manner in which various search operators behave, we propose a novel framework based on the proximity characteristics among the individual solutions as they evolve. Our framework incorporates information of neighboring individuals, in an attempt to efficiently guide the evolution of the population toward the global optimum, without sacrificing the search capabilities of the algorithm. More specifically, the random selection of parents during mutation is modified, by assigning to each individual a probability of selection that is inversely proportional to its distance from the mutated individual. The proposed framework can be applied to any mutation strategy with minimal changes. In this paper, we incorporate this framework in the original differential evolution algorithm, as well as other recently proposed differential evolution variants. Through an extensive experimental study, we show that the proposed framework results in enhanced performance for the majority of the benchmark problems studied.
Keyword:
Affinity matrix
differential evolution
mutation operator
nearest neighbors
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Genotypic differences in storage losses of sugar beet – causes and indirect criteria for selection
PREAI
分享收藏Characterizing the Properties of Anion-Binding Bis(cyclopeptides) with Solvent-Independent Energy Increments.png)
Chemistry
OAAI
ChemistryIF0
OAAI分享收藏
查看更多内容