A Study on Self-adaptation in the Evolutionary Strategy Algorithm - Computational Intelligence and Its Applications Access content directly
Conference Papers Year : 2018

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.
Fichier principal
Vignette du fichier
467079_1_En_14_Chapter.pdf (442.46 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01913901 , version 1 (07-11-2018)

Licence

Attribution

Identifiers

Cite

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⟩
72 View
285 Download

Altmetric

Share

Gmail Facebook X LinkedIn More