Adaptive Memetic Differential Evolution with Global and Local neighborhood-based mutation operators

• Authors: Adam P. Piotrowski
• Venue: Information Sciences: an International Journal
• Year: 2013

Differential Evolution (DE) is one of the most popular optimization methods for real-valued problems and a large number of its variants have been proposed so far. However, bringing together different ideas that already led to successful DE versions is rare in the literature. In the present paper a novel DE algorithm is proposed, in which three among the most efficient concepts already applied separately within DE framework are gathered together, namely: (1) the adaptation of algorithm control parameters and probabilities of using different mutation strategies; (2) the use of Nelder-Mead algorithm as a local search method hybridized with DE; and (3) the splitting mutation into Global and Local models, when Local mutation model is based on the concept of neighborhood of individuals organized on a ring topology. The performance of the novel algorithm, called Adaptive Memetic DE with Global and Local neighborhood-based mutation operators is compared with 13 different DE variants on a set of 25 popular problems which include rotated, shifted and hybrid composition functions. It is found that, although none DE algorithm outperforms all the others for the majority of problems, on average the proposed approach perform better than all 13 DE algorithms selected for comparison. The proposed algorithm is another heuristic approach developed to solve optimization problems. The question may arise, whether proposing novel methods is useful as No Free Lunch theorems for optimization state that the expected performance of all possible heuristics on all possible problems is equal. In the last section of the paper the limitations and implications of No Free Lunch theorems are discussed based on rich, but unfortunately frequently neglected literature. A very simple continuous and differentiable minimization problem is proposed, for which it is empirically verified that each among considered 14 DE algorithms perform poorer than random sampling. It is also empirically shown that when all considered DE algorithms search for the maximum of the proposed problem, they found lower minimum than DE algorithms searching for the minimum. Such result is not unexpected according to No Free Lunch theorems and should be considered as a precaution from generalization of good performance of heuristic optimization methods.