Parallel genetic algorithm taxonomy

10 years 10 months ago
Parallel genetic algorithm taxonomy
—Genetic Algorithms (GAs) are powerful search techniques that are used to solve difficult problems in many disciplines. Unfortunately, they can be very demanding in terms of computation load and memory. Parallel Genetic Algorithms (PGAs) are parallel implementations of GAs which can provide considerable gains in terms of performance and scalability. PGAs can easily be implemented on networks of heterogeneous computers or on parallel mainframes. In this paper we review the state of the art on PGAs and propose a new taxonomy also including a new form of PGA (the dynamic deme model) we have recently developed.
Mariusz Nowostawski, Riccardo Poli
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where KES
Authors Mariusz Nowostawski, Riccardo Poli
Comments (0)