A rigorous view on neutrality

Benjamin Doerr; Michael Gnewuch; Nils Hebbinghaus; Frank Neumann

doi:10.1109/CEC.2007.4424797

A rigorous view on neutrality

Benjamin Doerr
, Michael Gnewuch
, Nils Hebbinghaus
, Frank Neumann

Max-Planck-Institut fur Informatik
Christian-Albrechts-University Kiel

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

Résumé

Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the search space and point out situations where the use of neutrality significantly influence the runtime of an evolutionary algorithm.

langue originale	Anglais
titre	2007 IEEE Congress on Evolutionary Computation, CEC 2007
Editeur	IEEE Computer Society
Pages	2591-2597
Nombre de pages	7
ISBN (imprimé)	1424413400, 9781424413409
Les DOIs	https://doi.org/10.1109/CEC.2007.4424797
état	Publié - 1 janv. 2007
Modification externe	Oui
Evénement	2007 IEEE Congress on Evolutionary Computation, CEC 2007 - Singapore, Singapour Durée: 25 sept. 2007 → 28 sept. 2007

Série de publications

Nom	2007 IEEE Congress on Evolutionary Computation, CEC 2007

Une conférence

Une conférence	2007 IEEE Congress on Evolutionary Computation, CEC 2007
Pays/Territoire	Singapour
La ville	Singapore
période	25/09/07 → 28/09/07

Accès au document

10.1109/CEC.2007.4424797

Contient cette citation

@inproceedings{65d5ecb770e64252989e4a58cee81ded,

title = "A rigorous view on neutrality",

abstract = "Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the search space and point out situations where the use of neutrality significantly influence the runtime of an evolutionary algorithm.",

author = "Benjamin Doerr and Michael Gnewuch and Nils Hebbinghaus and Frank Neumann",

year = "2007",

month = jan,

day = "1",

doi = "10.1109/CEC.2007.4424797",

language = "English",

isbn = "1424413400",

series = "2007 IEEE Congress on Evolutionary Computation, CEC 2007",

publisher = "IEEE Computer Society",

pages = "2591--2597",

booktitle = "2007 IEEE Congress on Evolutionary Computation, CEC 2007",

note = "2007 IEEE Congress on Evolutionary Computation, CEC 2007 ; Conference date: 25-09-2007 Through 28-09-2007",

}

Doerr, B, Gnewuch, M, Hebbinghaus, N & Neumann, F 2007, A rigorous view on neutrality. Dans 2007 IEEE Congress on Evolutionary Computation, CEC 2007., 4424797, 2007 IEEE Congress on Evolutionary Computation, CEC 2007, IEEE Computer Society, p. 2591-2597, 2007 IEEE Congress on Evolutionary Computation, CEC 2007, Singapore, Singapour, 25/09/07. https://doi.org/10.1109/CEC.2007.4424797

A rigorous view on neutrality. / Doerr, Benjamin; Gnewuch, Michael; Hebbinghaus, Nils et al.
2007 IEEE Congress on Evolutionary Computation, CEC 2007. IEEE Computer Society, 2007. p. 2591-2597 4424797 (2007 IEEE Congress on Evolutionary Computation, CEC 2007).

Résultats de recherche: Le chapitre dans un livre, un rapport, une anthologie ou une collection › Contribution à une conférence › Revue par des pairs

TY - GEN

T1 - A rigorous view on neutrality

AU - Doerr, Benjamin

AU - Gnewuch, Michael

AU - Hebbinghaus, Nils

AU - Neumann, Frank

PY - 2007/1/1

Y1 - 2007/1/1

N2 - Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the search space and point out situations where the use of neutrality significantly influence the runtime of an evolutionary algorithm.

AB - Motivated by neutrality observed in natural evolution often redundant encodings are used in evolutionary algorithms. Many experimental studies have been carried out on this topic. In this paper we present a first rigorous runtime analysis on the effect of using neutrality. We consider a simple model where a layer of constant fitness is distributed in the search space and point out situations where the use of neutrality significantly influence the runtime of an evolutionary algorithm.

U2 - 10.1109/CEC.2007.4424797

DO - 10.1109/CEC.2007.4424797

M3 - Conference contribution

AN - SCOPUS:77955913917

SN - 1424413400

SN - 9781424413409

T3 - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

SP - 2591

EP - 2597

BT - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

PB - IEEE Computer Society

T2 - 2007 IEEE Congress on Evolutionary Computation, CEC 2007

Y2 - 25 September 2007 through 28 September 2007

ER -

A rigorous view on neutrality

Résumé

Série de publications

Une conférence

Accès au document

Empreinte digitale

Contient cette citation