Improved Genetic Programming Based on Lineage Information

At present, it is a major challenge to adopt an effective search method in genetic programming in order to produce an acceptable model in the search space. How to improve the efficiency of GP in a short period of time to produce better solution is very important. Traditional GP use of all the chromosomes for breeding, its search space for complex issues is enormous. In this paper, we introduce lineage relationship of chromosome in GP and propose an improved lineage-based genetic programming algorithm, ILBGP: use of lineage information of several ancestors, at the same time only retains one chromosome with the same fitness randomly. This method maintains the diversity, which can search the space effectively and avoid premature convergence toward local optima.