Skip to Main content Skip to Navigation
New interface
Conference papers

A Study on Self-adaptation in the Evolutionary Strategy Algorithm

Abstract : Nature-inspired algorithms attract many researchers worldwide for solving the hardest optimization problems. One of the well-known members of this extensive family is the evolutionary strategy ES algorithm. To date, many variants of this algorithm have emerged for solving continuous as well as combinatorial problems. One of the more promising variants, a self-adaptive evolutionary algorithm, has recently been proposed that enables a self-adaptation of its control parameters. In this paper, we discuss and evaluate popular common and self-adaptive evolutionary strategy (ES) algorithms. In particular, we present an empirical comparison between three self-adaptive ES variants and common ES methods. In order to assure a fair comparison, we test the methods by using a number of well-known unimodal and multimodal, separable and non-separable, benchmark optimization problems for different dimensions and population size. The results of this experiments study were promising and have encouraged us to invest more efforts into developing in this direction.
Document type :
Conference papers
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : Hal Ifip Connect in order to contact the contributor
Submitted on : Wednesday, November 7, 2018 - 10:16:46 AM
Last modification on : Thursday, March 3, 2022 - 5:24:02 PM
Long-term archiving on: : Friday, February 8, 2019 - 1:17:08 PM


Files produced by the author(s)


Distributed under a Creative Commons Attribution 4.0 International License



Noureddine Boukhari, Fatima Debbat, Nicolas Monmarché, Mohamed Slimane. A Study on Self-adaptation in the Evolutionary Strategy Algorithm. 6th IFIP International Conference on Computational Intelligence and Its Applications (CIIA), May 2018, Oran, Algeria. pp.150-160, ⟨10.1007/978-3-319-89743-1_14⟩. ⟨hal-01913901⟩



Record views


Files downloads