Differential Evolution (DE) has been successfully applied to various optimization problems. The performance of DE is affected by algorithm parameters such as a scaling factor F and a crossover rate CR. Many studies have been done to control the parameters adaptively. One of the most successful studies on controlling the parameters is JADE. In JADE, the values of each parameter are generated according to one probability density function (PDF) which is learned by the values in success cases where the child is better than the parent. However, search performance might be improved by learning multiple PDFs for each parameter based on some characteristics of search points. In this study, search points are divided into plural groups according to the rank of their objective values and the PDFs are learned by parameter values in success cases for each group. The advantage of JADE with the group-based learning is shown by solving thirteen benchmark problems.
CITATION STYLE
Takahama, T., & Sakai, S. (2017). An adaptive differential evolution with learning parameters according to groups defined by the rank of objective values. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10385 LNCS, pp. 411–419). Springer Verlag. https://doi.org/10.1007/978-3-319-61824-1_45
Mendeley helps you to discover research relevant for your work.