Benchmarking the differential evolution with adaptive encoding on noiseless functions

Authors:
Petr Pošík;Václav Klemš
Affiliations:
Czech Technical University in Prague, Prague, Czech Rep;Czech Technical University in Prague, Prague, Czech Rep
Venue:
Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Year:
2012

Citing 5
Cited 0

Differential Evolution – A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces

Journal of Global Optimization
Completely Derandomized Self-Adaptation in Evolution Strategies

Evolutionary Computation
Adaptive Encoding: How to Render Search Coordinate System Invariant

Proceedings of the 10th international conference on Parallel Problem Solving from Nature: PPSN X
JADE: adaptive differential evolution with optional external archive

IEEE Transactions on Evolutionary Computation
Self-Adapting Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems

IEEE Transactions on Evolutionary Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The differential evolution (DE) algorithm is equipped with the recently proposed adaptive encoding (AE) which makes the algorithm rotationally invariant. The resulting algorithm, DEAE, should exhibit better performance on non-separable functions. The aim of this article is to assess what benefits the AE has, and what effect it has for other function groups. DEAE is compared against pure DE, an adaptive version of DE (JADE), and an evolutionary strategy with covariance matrix adaptation (CMA-ES). The results suggest that AE indeed improves the performance of DE, particularly on the group of unimodal non-separable functions, but the adaptation of parameters used in JADE is more profitable on average. The use of AE inside JADE is envisioned.