Evolutionary Demographic Algorithms

05/22/2016
by   Marco AR Erra, et al.
0

Most of the problems in genetic algorithms are very complex and demand a large amount of resources that current technology can not offer. Our purpose was to develop a Java-JINI distributed library that implements Genetic Algorithms with sub-populations (coarse grain) and a graphical interface in order to configure and follow the evolution of the search. The sub-populations are simulated/evaluated in personal computers connected trough a network, keeping in mind different models of sub-populations, migration policies and network topologies. We show that this model delays the convergence of the population keeping a higher level of genetic diversity and allows a much greater number of evaluations since they are distributed among several computers compared with the traditional Genetic Algorithms.

READ FULL TEXT

page 3

page 4

research
01/05/2018

Dynamic Island Model based on Spectral Clustering in Genetic Algorithm

How to maintain relative high diversity is important to avoid premature ...
research
07/03/2017

A Distance Between Populations for n-Points Crossover in Genetic Algorithms

Genetic algorithms (GAs) are an optimization technique that has been suc...
research
04/22/2021

cMLSGA: A Co-Evolutionary Multi-Level Selection Genetic Algorithm for Multi-Objective Optimization

In practical optimisation the dominant characteristics of the problem ar...
research
08/03/2020

Analyzing the Components of Distributed Coevolutionary GAN Training

Distributed coevolutionary Generative Adversarial Network (GAN) training...
research
01/19/2014

Revolutionary Algorithms

The optimization of dynamic problems is both widespread and difficult. W...
research
01/20/2023

Massively Parallel Genetic Optimization through Asynchronous Propagation of Populations

We present Propulate, an evolutionary optimization algorithm and softwar...

Please sign up or login with your details

Forgot password? Click here to reset