Implementing a Software Cache for Genetic Programming Algorithms for Reducing Execution Time

Savvas Karatsiolis, Christos Schizas

2014

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.

References

  1. Koza, John R.. Genetic programming: on the programming of computers by means of natural selection. Cambridge, Mass.: MIT Press, 1992. Print.
  2. Kinnear, Kenneth E.. Advances in genetic programming. Cambridge, Mass.: MIT Press, 1994. Print.
  3. Koza, John R.. Genetic programming III: darwinian invention and problem solving. San Francisco: Morgan Kaufmann, 1999. Print.
  4. Poli, Riccardo, and W. B. Langdon. A field guide to genetic programming. S.I.: [Lulu Press], lulu.com, 2008. Print.
  5. Penousal Machado and Amilcar Cardoso. Speeding up Genetic Programming. In Proceedings of the Second International Symposium on Artificial Intelligence, Adaptive Systems (CIMAF - 99), Havana, Cuba, 1999
  6. V. Ciesielski and X. Li. Analysis of genetic programming runs. In R. I. Mckay and S.-B. Cho, editors, Proceedings of The Second Asian-Pacific Workshop on Genetic Programming, Cairns, Australia, 6-7 December 2004
  7. S. Handley. On the use of a directed acyclic graph to represent a population of computer programs. In Proceedings of the 1994 IEEE World Congress on Computational Intelligence, 1994. IEEE Press
Download


Paper Citation


in Harvard Style

Karatsiolis S. and Schizas C. (2014). Implementing a Software Cache for Genetic Programming Algorithms for Reducing Execution Time . In Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014) ISBN 978-989-758-052-9, pages 259-265. DOI: 10.5220/0005081202590265


in Bibtex Style

@conference{ecta14,
author={Savvas Karatsiolis and Christos Schizas},
title={Implementing a Software Cache for Genetic Programming Algorithms for Reducing Execution Time},
booktitle={Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)},
year={2014},
pages={259-265},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0005081202590265},
isbn={978-989-758-052-9},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Evolutionary Computation Theory and Applications - Volume 1: ECTA, (IJCCI 2014)
TI - Implementing a Software Cache for Genetic Programming Algorithms for Reducing Execution Time
SN - 978-989-758-052-9
AU - Karatsiolis S.
AU - Schizas C.
PY - 2014
SP - 259
EP - 265
DO - 10.5220/0005081202590265