Integrating adaptive mutations and family competition into genetic algorithms as function optimizer

 In this paper, we propose a robust evolutionary algorithm, called adaptive mutations genetic algorithm, for function optimization problems. Our main contribution is robustly optimizing problems whose number of variables from 2 to 200. In order to have a fair comparison, we propose the criteria for constructing a testing bed and for classifying these problems into different complexity degrees. The proposed approach, based on the family competition and multiple adaptive rules, successfully integrates the decreasing-based Gaussian mutation and self-adaptive Cauchy mutation to balance the exploitation and exploration. It is implemented and applied to widely used test functions and several nonseparable multimodal functions. Experimental results indicate that our approach is more robust than ten evolutionary algorithms.

Authors and Affiliations

1. Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan Tel.: 886-2-2362-5336 ext 509 e-mail: {moon, cykao}@csie.ntu.edu.tw, , , , , , TW

   J.-M. Yang & C.-Y. Kao

Reprints and permissions