Normalization for Genetic Algorithms With Nonsynonymously Redundant Encodings

Authors:
Sung-Soon Choi;Byung-Ro Moon
Affiliations:
Random Graph Res. Center, Yonsei Univ., Seoul;-
Venue:
IEEE Transactions on Evolutionary Computation
Year:
2008

Citing 0
Cited 5

Search, neutral evolution, and mapping in evolutionary computing: a case study of grammatical evolution

IEEE Transactions on Evolutionary Computation
Genetic approaches for graph partitioning: a survey

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Quotient geometric crossovers and redundant encodings

Theoretical Computer Science
Representations for evolutionary algorithms

Proceedings of the 14th annual conference companion on Genetic and evolutionary computation
Representations for evolutionary algorithms

Proceedings of the 15th annual conference companion on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Normalization transforms one parent genotype to be consistent with the other before crossover. In this paper, we explain how normalization alleviates the difficulties caused by nonsynonymously redundant encodings in genetic algorithms. We define the encodings with maximally nonsynonymous property and prove that the encodings induce uncorrelated search spaces. Extensive experiments for a number of problems show that normalization transforms the uncorrelated search spaces to correlated ones and leads to significant improvement in performance.