کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
495507 | 862828 | 2014 | 20 صفحه PDF | دانلود رایگان |
• The behavior of the crossover in differential evolution (DE) is analyzed.
• A crossover rate repair technique for the adaptive DE algorithm is proposed.
• The crossover rate in DE is repaired by its corresponding binary string, i.e. by using the average number of components taken from the mutant.
• Experimental results indicate that our proposed crossover rate technique is able to enhance the performance of JADE.
Differential evolution (DE) is a simple yet powerful evolutionary algorithm (EA) for global numerical optimization. However, its performance is significantly influenced by its parameters. Parameter adaptation has been proven to be an efficient way for the enhancement of the performance of the DE algorithm. Based on the analysis of the behavior of the crossover in DE, we find that the trial vector is directly related to its binary string, but not directly related to the crossover rate. Based on this inspiration, in this paper, we propose a crossover rate repair technique for the adaptive DE algorithms that are based on successful parameters. The crossover rate in DE is repaired by its corresponding binary string, i.e. by using the average number of components taken from the mutant. The average value of the binary string is used to replace the original crossover rate. To verify the effectiveness of the proposed technique, it is combined with an adaptive DE variant, JADE, which is a highly competitive DE variant. Experiments have been conducted on 25 functions presented in CEC-2005 competition. The results indicate that our proposed crossover rate technique is able to enhance the performance of JADE. In addition, compared with other DE variants and state-of-the-art EAs, the improved JADE method obtains better, or at least comparable, results in terms of the quality of final solutions and the convergence rate.
Figure optionsDownload as PowerPoint slide
Journal: Applied Soft Computing - Volume 15, February 2014, Pages 149–168