We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic programming (GP) and implement it as code reuse between GP trees that evolve in parallel in separate populations delegated to particular tasks. The technical means of code reuse is a crossbreeding operator which works very similar to standard tree-swapping crossover. We consider two variants of this operator, which differ in the way they handle the incompatibility of terminals between the considered problems. In the experimental part we demonstrate that such code reuse is usually beneficial and leads to success rate improvements when solving the common boolean benchmarks.
@INPROCEEDINGS { jaskowski08reuse,
ABSTRACT = { We propose a method of knowledge reuse between evolutionary processes that solve different optimization tasks. We define the method in the framework of tree-based genetic programming (GP) and implement it as code reuse between GP trees that evolve in parallel in separate populations delegated to particular tasks. The technical means of code reuse is a crossbreeding operator which works very similar to standard tree-swapping crossover. We consider two variants of this operator, which differ in the way they handle the incompatibility of terminals between the considered problems. In the experimental part we demonstrate that such code reuse is usually beneficial and leads to success rate improvements when solving the common boolean benchmarks. },
ADDRESS = { New York, NY, USA },
AUTHOR = { Wojciech Ja{\'s}kowski and Krzysztof Krawiec and Bartosz Wieloch },
BOOKTITLE = { GECCO '08: Proceedings of the 2008 GECCO conference companion on Genetic and evolutionary computation },
COMMENT = { ProjectELP },
DOI = { http://doi.acm.org/10.1145/1388969.1389040 },
ISBN = { 978-1-60558-131-6 },
LOCATION = { Atlanta, GA, USA },
PAGES = { 2159--2164 },
PUBLISHER = { ACM },
TITLE = { Multi-task code reuse in genetic programming },
YEAR = { 2008 },
1 = { http://doi.acm.org/10.1145/1388969.1389040 },
}