A new model of Genetic Programming with variable size population is presented in this paper and applied to the reconstruction of target functions in dynamic environments (i.e. problems where target functions change with time). The suitability of this model is tested on a set of benchmarks based on some well known symbolic regression problems. Experimental results confirm that our variable size population model finds solutions of the same quality as the ones found by standard Genetic Programming, but with a smaller amount of computational effort.
|Title of host publication||Proceedings of the 11th Annual conference on Genetic and evolutionary computation|
|Publisher||ACM - Association for Computing Machinery|
|Publication status||Published - 1 Jan 2009|
|Event||GECCO ’09 - |
Duration: 1 Jan 2009 → …
|Period||1/01/09 → …|