Measures and methods for robust genetic programming

This thesis proposes several measures for a better understanding of the dynamic of the evolutionary process. In particular, measures to control bloat, overfitting and complexity of the solutions are defined. Moreover, several methods to improve the generalization ability of the solutions produced by the standard Genetic Programming (GP) algorithm are proposed. This thesis also focuses on the role of semantic in GP. In particular, a new GP algorithm that uses only semantic information is proposed. Finally, a study on the effect of multi objective optimization in GP is performed.