In this paper, a set of safe adaptive genetic algorithms (sGAs) is proposed based on the Splicing/Decomposable encoding scheme and the efficient speed-up strategies developed by Xu et al.. The proposed algorithms implement the self-adaptation of the problem representation, selection and recombination operators at the levels of population, individual and component which commendably balance the conflicts between "reliability" and "efficiency", as well as "exploitation" and "exploration" existed in the evolutionary algorithms. It is shown that the algorithms converge to the optimum solution in probability one. The proposed sGAs are experimentally compared with the classical genetic algorithm (CGA), non-uniform genetic algorithm (nGA) proposed by Michalewicz, forking genetic algorithm (FGA) proposed by Tsutsui et al. and the classical evolution programming (CEP). The experiments indicate that the new algorithms perform much more efficiently than CGA and FGA do, comparable with the real-coded GAs? - nGA and CEP. All the algorithms are further evaluated through an application to a difficult real-life application problem: the inverse problem of fractal encoding related to fractal image compression technique. The results for the sGA is better than those of CGA and FGA, and has the same, sometimes better performance compared to those of nGA and CEP.
Compares a few adaptiive GA systems to each other. The adaptive ones may be useful for looking into, although they don't tend to change the representation at a deeper level. This paper also contains a number of test problems which could be used.