Extended compact genetic algorithm

iECGA: Integer Extended Compact Genetic Algorithm-Ping-Chu Hung-Ying-Ping Chen

Extended compact genetic algorithm (ECGA) is an algorithm that can solve hard problems
in the binary domain. ECGA is reliable and accurate because of the capability of
detecting building blocks, but certain difficulties are encountered when we directly apply
ECGA to problems in the integer domain. In this paper, we propose a new algorithm that
extends ECGA, called integer extended compact genetic algorithm (iECGA). iECGA uses
a modified probability model and inherits the capability of detecting building blocks from
ECGA. iECGA is specifically designed for problems in the integer domain and can avoid the
difficulties that ECGA encounters. In the experimental results, we show the performance
comparisons between ECGA, iECGA, and a simple GA, and the results indicate that iECGA
has good performances on problems in the integer domain.