A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Study on encoding schemes in compact genetic algorithm for the continuous numerical problems
2007
SICE Annual Conference 2007
In this paper, we experimented how the performance of compact genetic algorithms (cGAs) become different according to two competitive encoding schemes: binary encoding and gray encoding scheme. We apply two encoding schemes to original cGA in various numerical problems including continuous and multimodal problems as well as unimodal problems. Experimental results unexpectedly show that the binary encoding is more effective in the almost the problems using an original cGA, unlike the case of using GA.
doi:10.1109/sice.2007.4421447
fatcat:ovcrueegtzegrigqlqhvj2r7ky