Adelaide Research & Scholarship
Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/66757
| Citations | ||
| Scopus | Web of Science® | Altmetric |
|---|---|---|
|
?
|
?
|
|
| Type: | Conference paper |
| Title: | A Rigorous View On Neutrality |
| Author: | Doerr, B. Gnewuch, M. Hebbinghaus, N. Neumann, F. |
| Citation: | 2007 Congress on Evolutionary Computation, CEC 2007 : Proceedings, Singapore 25-28th September, 2007, pp. 2591-2597 |
| Publisher: | IEEE |
| Publisher Place: | Piscataway, N.J. |
| Issue Date: | 2007 |
| Series/Report no.: | IEEE Congress on Evolutionary Computation |
| ISBN: | 9781424413393 |
| Conference Name: | IEEE Congress on Evolutionary Computation (2007 : Singapore) |
| Statement of Responsibility: | Benjamin Doerr, Michael Gnewuch, Nils Hebbinghaus, Frank Neumann |
| 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. |
| Rights: | © 2007 IEEE |
| DOI: | 10.1109/CEC.2007.4424797 |
| Published version: | http://dx.doi.org/10.1109/cec.2007.4424797 |
| Appears in Collections: | Aurora harvest Computer Science publications |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.