Implementing a software cache for genetic programming algorithms for reducing execution time

Abstract

A cache holding reusable computations that are carried out during the execution of a genetic algorithm is implemented and maintained in order to improve the performance of the genetic algorithm itself. The main idea is that the operational genome is actually consisting of small computational blocks that tend to be interchanged and reused several times before they complete (or not) their lifecycle. By computing these blocks once and keeping them in memory for future possible reuse, the algorithm is allowed to run up to fifty times faster according experimental results maintaining a general case execution time reduction of four times. The consistency of the cache is maintained through simple rules that validate entries in a very straight forward manner during the genetic operations of cross over and mutation.