4.7 Article

Differential Evolution with Group-Based Competitive Control Parameter Setting for Numerical Optimization

期刊

MATHEMATICS
卷 11, 期 15, 页码 -

出版社

MDPI
DOI: 10.3390/math11153355

关键词

numerical optimization; differential evolution; mutation strategy; control parameter setting; population reduction mechanism

向作者/读者索取更多资源

This paper proposes a new variant of the differential evolution (DE) algorithm to mitigate its drawbacks such as premature convergence and stagnation. It introduces a novel mutation operator and a group-based competitive control parameter setting. The new mutation operator determines the scope of guidance based on the individual's fitness value. The competitive control parameter setting divides the population into equivalent groups and updates the worst location information with the current successful parameters. The proposed algorithm also incorporates a piecewise population size reduction mechanism to enhance exploration and exploitation at different stages. Experimental results demonstrate the superiority of the proposed method compared to other DE variants and non-DE algorithms.
Differential evolution (DE) is one of the most popular and widely used optimizers among the community of evolutionary computation. Despite numerous works having been conducted on the improvement of DE performance, there are still some defects, such as premature convergence and stagnation. In order to alleviate them, this paper presents a novel DE variant by designing a new mutation operator (named DE/current-to-pbest_id/1) and a new control parameter setting. In the new operator, the fitness value of the individual is adopted to determine the chosen scope of its guider among the population. Meanwhile, a group-based competitive control parameter setting is presented to ensure the various search potentials of the population and the adaptivity of the algorithm. In this setting, the whole population is randomly divided into multiple equivalent groups, the control parameters for each group are independently generated based on its location information, and the worst location information among all groups is competitively updated with the current successful parameters. Moreover, a piecewise population size reduction mechanism is further devised to enhance the exploration and exploitation of the algorithm at the early and later evolution stages, respectively. Differing from the previous DE versions, the proposed method adaptively adjusts the search capability of each individual, simultaneously utilizes multiple pieces of successful parameter information to generate the control parameters, and has different speeds to reduce the population size at different search stages. Then it could achieve the well trade-off of exploration and exploitation. Finally, the performance of the proposed algorithm is measured by comparing with five well-known DE variants and five typical non-DE algorithms on the IEEE CEC 2017 test suite. Numerical results show that the proposed method is a more promising optimizer.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据