.png){kind=icon}
Return
Accelerating differential evolution using an adaptive local search
.png){kind=icon}
PRE
AI
DOI：10.1109/TEVC.2007.895272.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We propose a crossover-based adaptive local search (LS) operation for enhancing the performance of standard differential evolution (DE) algorithm. Incorporating LS heuristics is often very useful in designing an effective evolutionary algorithm for global optimization. However, determining a single LS length that can serve for a wide range of problems is a critical issue. We present a LS technique to solve this problem by adaptively adjusting the length of the search, using a hill-climbing heuristic. The emphasis of this paper is to demonstrate how this LS scheme can improve the performance of DE. Experimenting with a wide range of benchmark functions, we show that the proposed new version of DE, with the adaptive LS, performs better, or at least comparably, to classic DE algorithm. Performance comparisons with other LS heuristics and with some other well-known evolutionary algorithms from literature are also presented.
Keywords:
differential evolution (DE)
global optimization
local search (LS)
memetic algorithm (MA)
Journal
IF:
12
Papers:
1.8K
Citations:
2.4W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSave
View more