A common method for improving a genetic programming search on difficult problems is either multiplying the number of runs or increasing the population size. In this paper we propose a new search strategy which attempts to obtain a higher probability of success with smaller amounts of computational resources. We call this model Divide & Conquer since our algorithm initially partitions the search space in smaller regions that are explored independently of each other. Then, our algorithm collects the most competitive individuals found in each partition and exploits them in order to get a solution. We benchmarked our proposal on three problem domains widely used in the literature. Our results show a significant improvement of the likelihood of success while requiring less computational resources than the standard algorithm. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Fillon, C., & Bartoli, A. (2006). A divide & conquer strategy for improving efficiency and probability of success in genetic programming. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3905 LNCS, pp. 13–23). https://doi.org/10.1007/11729976_2
Mendeley helps you to discover research relevant for your work.