Selected population characteristics of fine-grained parallel genetic algorithms with re-initialization

Authors:
Ivan Sekaj;Michal Oravec
Affiliations:
Slovak University of Technology, Bratislava, Slovakia;Slovak University of Technology, Bratislava, Slovakia
Venue:
Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation
Year:
2009

Citing 4
Cited 1

The GENITOR algorithm and selection pressure: why rank-based allocation of reproductive trials is best

Proceedings of the third international conference on Genetic algorithms
Genetic algorithms + data structures = evolution programs (3rd ed.)

Genetic algorithms + data structures = evolution programs (3rd ed.)
Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms

Journal of Heuristics
The influence of migration sizes and intervals on island models

GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation

Shared memory genetic algorithms in a multi-agent context

Proceedings of the 12th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A class of fine-grained parallel genetic algorithms (F-PGA) are analyzed and experimentally compared. Each node of the F-PGA represents a single individual. Selected topologies are proposed, which are using various parent selection and offspring selection methods. Also the influence of population re-initialization on the parallel genetic algorithm performance is analyzed and selected characteristics of evolutionary algorithm population are proposed. These characteristics represent such properties as relative number of modified genes and number of duplicate individuals in population. The results are demonstrated on examples with minimization of selected test functions.