Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

SPDP

1991

IEEE

1991

IEEE

The parallel genetic algorithm (PGA) is a prototype of a new kind of a distributed algorithm. It is based on a parallel search by individuals all of which have the complete problem description. The information exchange between the individuals is done by simulating biological principles of evolution. The PGA is totally asynchronous, running with maximal e ciency on MIMD parallel computers. The search strategy of the PGA is based on a small number of intelligent and active individuals, whereas a GA uses a large population of passive individuals. We will show the power of the PGA with two combinatorial problems - the graph partitioning problem and the autocorrelation problem. In these examples, the PGA has found solutions of very large problems, which are comparable or even better than any other solution found by other heuristics.

Related Content

Added |
27 Aug 2010 |

Updated |
27 Aug 2010 |

Type |
Conference |

Year |
1991 |

Where |
SPDP |

Authors |
Heinz Mühlenbein |

Comments (0)