Solving the Boolean Multiplexer Problem with Distributed Genetic Programming

Abstract

We demonstrate the effectiveness and power of the distributed GP platform, EC-Star, by comparing the computational power needed for solving an 11-multiplexer function, both on a single machine using a full-fitness evaluation method, as well as using distributed, age-layered, partial-fitness evaluations and a Pitts-style representation. We study the impact of age-layering and show how the system scales with distribution and tends towards smaller solutions. We also consider the effect of pool size and the choice of fitness function on convergence and total computation.