.png){kind=icon}
Return
A differential memetic algorithm
.png){kind=icon}
PRE
AI
DOI：10.1007/s10462-011-9302-2.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Memetic algorithms have been devised to rectify the absence of a local search mechanism in evolutionary algorithms. This paper proposes a differential memetic algorithm (DMA). To this end, first we propose a differential bidirectional random search as a local search algorithm. Then, a randomized blending crossover (RBleX) is proposed which aimed to scatter the new born offspring more diversely in the whole search space. We devise our proposed DMA, by using the RBleX crossover in the GA, and including the DBRS local search algorithm. A comparison of the performance of the DMA and those of seven other evolutionary/memetic or hybrid algorithms reported in two different papers on numerous bechmark functions demonstrates better performance of proposed DMA algorithm in most of the cases.
Keywords:
Differential memetic algorithm
Differential bidirectional random search
Randomized blending crossover
Evolutionary computations
Journal
IF:
13.9
Papers:
6.1K
Citations:
1.9W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSaveShareSave
View more