Parallel genetic algorithms: a survey and problem state of the art

In relation with development of computer capabilities and the appearance of multicore processors, parallel computing made it possible to reduce the time for solution of optimization problems. At present of interest are methods of parallel computing for genetic algorithms using the evolutionary model...

Full description

Saved in:
Bibliographic Details
Published in:Journal of computer & systems sciences international 2010-08, Vol.49 (4), p.579-589
Main Authors: Knysh, D. S., Kureichik, V. M.
Format: Article
Language:English
Subjects:
Algorithms
Analysis
Chromosomes
Computation
Computer Methods
Control
Distributed processing
Dynamics
Efficiency
Engineering
Genetic algorithms
Joints
Mathematical models
Mechatronics
Optimization
Parallel processing
Population
Robotics
Studies
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In relation with development of computer capabilities and the appearance of multicore processors, parallel computing made it possible to reduce the time for solution of optimization problems. At present of interest are methods of parallel computing for genetic algorithms using the evolutionary model of development in which the main component is the population of species (set of alternative solutions to the problem). In this case, the algorithm efficiency increases due to parallel development of several populations. The survey of basic parallelization strategies and the most interesting models of their implementation are presented. Theoretical ideas on improvement of existing parallelization mechanisms for genetic algorithms are described. A modified model of parallel genetic algorithm is developed. Since genetic algorithms are used for solution of optimization problems, the proposed model was studied for the problem of optimization of a multicriteria function. The algorithm capabilities of getting out of local optima and the influence of algorithm parameters on the deep extremum search dynamics were studied. The conclusion on efficiency of application of dynamic connections of processes, rather than static connections, is made. New mechanisms for implementation and analysis of efficiency of dynamic connections for distributed computing in genetic algorithms are necessary.
ISSN:1064-2307
1555-6530
DOI:10.1134/S1064230710040088