Please use this identifier to cite or link to this item:
|Scopus||Web of Science®||Altmetric|
|Title:||When to use bit-wise neutrality|
|Citation:||Proceedings of the IEEE Congress on Evolutionary Computation, 2008 (IEEE World Congress on Computational Intelligence), 1-6 June, 2008, pp. 997-1003|
|Publisher Place:||Los Alamitos, California|
|Series/Report no.:||IEEE Congress on Evolutionary Computation|
|Conference Name:||IEEE Congress on Evolutionary Computation (2008 : Hong Kong)|
|Tobias Friedrich and Frank Neumann|
|Abstract:||Representation techniques are important issues when designing successful evolutionary algorithms. Within this field the use of neutrality plays an important role. We examine the use of bit-wise neutrality introduced by Poli and Lopez (2007) from a theoretical point of view and show that this mechanism only enhances mutation-based evolutionary algorithms if not the same number of genotypic bits for each phenotypic bit is used. Using different numbers of genotypic bits for the bits in the phenome we point out by rigorous runtime analyses that it may reduce the optimization time significantly.|
|Rights:||© 2008 IEEE|
|Appears in Collections:||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.