Global Optimum-Based Search Differential Evolution

Yang Yu

doi:10.1109/JAS.2019.1911378

Global Optimum-Based Search Differential Evolution

2019-03-01

78

PRE

AI

DOI：10.1109/JAS.2019.1911378

原文链接

原文求助

摘要

En 中文

In this paper, a global optimum-based search strategy is proposed to alleviate the situation that the differential evolution (DE) usually sticks into a stagnation, especially on complex problems. It aims to reconstruct the balance between exploration and exploitation, and improve the search efficiency and solution quality of DE. The proposed method is activated by recording the number of recently consecutive unsuccessful global optimum updates. It takes the feedback from the global optimum, which makes the search strategy not only refine the current solution quality, but also have a change to find other promising space with better individuals. This search strategy is incorporated with various DE mutation strategies and DE variations. The experimental results indicate that the proposed method has remarkable performance in enhancing search efficiency and improving solution quality.

Keyword:

Differential evolution (DE)

global optimum

memetic algorithm

Global Optimum-Based Search Differential Evolution

摘要

AI总结

期刊

机构

引用论文