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 López (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.

中文翻译：

---

何时使用按位中性。

在设计成功的进化算法时，表示技术是重要的问题。在这个领域中，中立的使用起着重要的作用。我们从理论的角度检查了 Poli 和 López (2007) 引入的按位中性的使用，并表明如果使用每个表型位的基因型位数量不同，这种机制只会增强基于突变的进化算法。我们通过严格的运行时分析指出，对现象组中的位使用不同数量的基因型位，这可能会显着减少优化时间。