A Unified Paradigm for Parallel Genetic Algorithms

Kapsalis, A., Smith, G. D. and Rayward-Smith, V. J. (1994) A Unified Paradigm for Parallel Genetic Algorithms. In: Evolutionary Computing. Lecture Notes in Computer Science, 865 . Springer, Heidelberg, pp. 131-149.

Full text not available from this repository. (Request a copy)


Genetic Algorithms contain natural parallelism. There are two main approaches in parallelising GAs. The first one is parallelising individual functional components of a standard, sequential GA. The only difference with the sequential GA is in the computation speed. The second approach more closely resembles the real life simultaneous evolution of species, which is the central theme in GAs. Algorithms following this approach are still referred to as GAs but are different from Holland's standard GA. For these algorithms it is not the improvement in computation speed that is the driving factor, but the efficiency with which they search a given solution space. We describe a number of the most common parallel GA methods found in the literature and mention practical issues concerning their implementation in a Transputer based system. We go on to introduce the Unified Parallel GA system, based on our GA toolkit, GAmeter, which allows the user to select one or more of the GA methods described, by setting various parameters. Finally we present results for the Steiner tree Problem in Graphs (SPG).

Item Type: Book Section
Faculty \ School: Faculty of Science > School of Computing Sciences
Depositing User: EPrints Services
Date Deposited: 01 Oct 2010 13:41
Last Modified: 15 Dec 2022 00:54
URI: https://ueaeprints.uea.ac.uk/id/eprint/3008
DOI: 10.1007/3-540-58483-8_11

Actions (login required)

View Item View Item