Distributed and Persistent Evolutionary Algorithms: A Design Pattern

  • Authors:
  • Alessandro Bollini;Marco Piastra

  • Affiliations:
  • -;-

  • Venue:
  • Proceedings of the Second European Workshop on Genetic Programming
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the scenario of distributed processing for evolutionary algorithms the adoption of object-oriented database management systems (ODBMS) may yield improvements in terms of both robustness and flexibility. Populations of evolvable individuals can be made persistent across several evolutionary runs, making it possible to devise incremental strategies. Moreover, virtually any number of evolutionary processes may be run in parallel on the same underlying population without explicit synchronization beyond that provided by the locking mechanism of the ODBMS. This paper describes a design pattern for a genetic programming environment that allows combining existing techniques with persistent population storage and management.