Often optimization problems involve the discovery of many scalar coefficients. Although genetic programming (GP) has been applied to the optimization and discovery of functions with an arbitrary number of scalar coefficients, recent results indicate that a method for fine-tuning GP scalar terminals can assist the discovery of solutions. In this paper we demonstrate an approach where genetic programming and evolution strategies (ES) are seamlessly combined. We apply our GP/ES hybrid, which we name Hierarchical Evolution Strategy, to the problem of evolving affine transformations and iterated function systems (IFS). We compare the results of our approach with GP and notice an improvement in performance in terms of discovering bsetter solutions and speed.
CITATION STYLE
Sarafopoulos, A. (2001). Evolution of affine transformations and iterated function systems using hierarchical evolution strategy. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2038, pp. 176–191). Springer Verlag. https://doi.org/10.1007/3-540-45355-5_14
Mendeley helps you to discover research relevant for your work.