Show simple item record

dc.contributor.authorNeri, Ferranteen
dc.contributor.authorTirronen, Villeen
dc.date.accessioned2012-08-13T11:43:36Z
dc.date.available2012-08-13T11:43:36Z
dc.date.issued2010-02
dc.identifier.citationNeri, F. and Tirronen, V. (2010) Recent advances in differential evolution: a survey and experimental analysis. Artificial Intelligence Review, 33, (1-2), pp 61-106en
dc.identifier.issn0269-2821
dc.identifier.urihttp://hdl.handle.net/2086/6814
dc.description.abstractDifferential Evolution (DE) is a simple and efficient optimizer, especially for continuous optimization. For these reasons DE has often been employed for solving various engineering problems. On the other hand, the DE structure has some limitations in the search logic, since it contains too narrow a set of exploration moves. This fact has inspired many computer scientists to improve upon DE by proposing modifications to the original algorithm. This paper presents a survey on DE and its recent advances. A classification, into two macro-groups, of the DE modifications is proposed here: (1) algorithms which integrate additional components within the DE structure, (2) algorithms which employ a modified DE structure. For each macro-group, four algorithms representative of the state-of-the-art in DE, have been selected for an in depth description of their working principles. In order to compare their performance, these eight algorithm have been tested on a set of benchmark problems. Experiments have been repeated for a (relatively) low dimensional case and a (relatively) high dimensional case. The working principles, differences and similarities of these recently proposed DE-based algorithms have also been highlighted throughout the paper. Although within both macro-groups, it is unclear whether there is a superiority of one algorithm with respect to the others, some conclusions can be drawn. At first, in order to improve upon the DE performance a modification which includes some additional and alternative search moves integrating those contained in a standard DE is necessary. These extra moves should assist the DE framework in detecting new promising search directions to be used by DE. Thus, a limited employment of these alternative moves appears to be the best option in successfully assisting DE. The successful extra moves are obtained in two ways: an increase in the exploitative pressure and the introduction of some randomization. This randomization should not be excessive though, since it would jeopardize the search. A proper increase in the randomization is crucial for obtaining significant improvements in the DE functioning. Numerical results showthat, among the algorithms considered in this study, the most efficient additional components in a DE framework appear to be the population size reduction and the scale factor local search. Regarding the modified DE structures, the global and local neighborhood search and self-adaptive control parameter scheme, recently proposed in literature, seem to be the most promising modifications.en
dc.language.isoenen
dc.publisherSpringeren
dc.subjectdifferential evolutionen
dc.subjectSurveyen
dc.subjectcomparative analysisen
dc.subjectself-adaptationen
dc.subjectcontinuous optimizationen
dc.titleRecent advances in differential evolution: a survey and experimental analysisen
dc.typeArticleen
dc.identifier.doihttp://dx.doi.org/10.1007/s10462-009-9137-2
dc.researchgroupCentre for Computational Intelligenceen
dc.researchinstituteInstitute of Artificial Intelligence (IAI)en


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record