First published 2 September 2013
Analyzing Program Evolution in Genetic Programming using Asynchronous Evaluation
Tomohiro Harada, Keiki Takadama
This paper investigates the evolution ability of Tierra-based Asynchronous Genetic Programming (TAGP) as GP using an asynchronous evaluation. We compare TAGP with two simple GP methods, steady-state GP and GP using (μ + λ)- selection as GP using a synchronous evaluation. Three GP methods are compared in experiment to minimize the size of an actual assembly language program in several computational problems, two arithmetic and two boolean problems. The intensive comparisons have revealed the following implications: (1) TAGP has higher evolution ability than GP using synchronous evaluation, i.e., TAGP can evolve smaller size programs which cannot be evolved by GPs using synchronous evaluation; and (2) the diversity of the programs evolved by TAGP can derive a high evolution ability in comparison with GP using synchronous evaluation.