arrow
返回

Cluster-centroid-based mutation strategies for Differential Evolution

delete2021-11-06
delete2
PRE
AI
G
Giovanni Iacca *
V
Vinícius Veloso de Melo
DOI:10.1007/s00500-021-06448-zdelete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Mutation is the main operator of differential evolution (DE), as it is responsible for combining the information of distinct solutions to generate a donor vector. Aiming at improving the search effectivity of DE, previous research incorporated the calculation of centroids into the DE mutations. In some of the existing methods, the centroids are simply calculated as the center of some selected solutions (or, the entire population); in other cases, one-step clustering is used to perform a local search, or the centroids themselves are used as actual solutions in the population. As opposed to these methods, in this paper we extend some traditional DE mutation strategies to incorporate centroids calculated by deterministic hierarchical clustering. Experimental results on two sets of well-known benchmark problems show that the proposed cluster-centroid-based mutation strategies outperform, in general, the traditional rand/1 strategy, as well as several metaheuristics from the literature. Therefore, the use of clustering is an effective way to improve the search performance that could be exploited also in other population-based metaheuristics.
Keyword:
Clustering
Mutation strategy
Differential Evolution
Global optimization
Machine learning
AI总结

AI总结

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

期刊

Soft Computing 封面图
Soft Computing
IF:
2.5
论文数:
1.0W
被引数:
2.1W

机构

U
University of Trento
学者数:
8.8K
论文数: 9.0K
被引数: 1.2W
引用论文

引用论文

err分享
err收藏
学者 查看更多内容