A unified model of non-panmictic population structures in evolutionary algorithms

This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.

Gespeichert in:

Bibliographische Detailangaben
1. Verfasser:	Sprave, J.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Biological system modeling Computer science Concurrent computing Evolutionary computation Genetic algorithms Parallel algorithms Parallel processing Shape Terminology Topology
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	This paper presents a formal model of population structures in evolutionary algorithms based on hypergraphs. Since it covers fine grained and coarse grained parallel approaches as well as the simple panmictic case, it provides a unified base for theoretical work on a broad range of algorithms.
DOI:	10.1109/CEC.1999.782644