Created by W.Langdon from gp-bibliography.bib Revision:1.4891
A straightforward representation of a solution is that of a matrix of thicknesses, based on a N by N (with N a power of two) discretization of the lens. However, even though some technical simplifications allow us to reduce the size of the search space, its complexity increased quadratically with N, making physically realistic cases (e.g. N >= 256) almost untractable (more than 2000 variables). An alternative representation is brought by GP parse trees, searching in functional space: the genotype does not depend anymore on the chosen discretization.
The implementation of both parametric representation (using ES algorithms) and functional approach (using standard GP) for the lens design are described. Both achieve good results compared to the sate-of-the-art methods for small to medium values of the discretization parameter N (up to 256). Moreover, preliminary comparative results are presented between the two representations, and some counter-intuitive results are discussed.",
Genetic Programming entries for Alain Racine Sana Ben Hamida Marc Schoenauer