caa a22 4500 477074685 CHVBK 20180405111436.0 cr unu---uuuuu 170330e19961201xx s 000 0 eng 10.1007/BF02900898 doi (NATIONALLICENCE)springer-10.1007/BF02900898 Mühlenbein Heinz GMD FZ Informationstechnik, D-53754, Sankt Augustin aut Genetic algorithms and parallel processing [Elektronische Daten] [Heinz Mühlenbein] 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 efficiency on MIMD parallel computers. We compare the PGA with the breeder genetic algorithm (BGA) based on methods used by breeders of livestock. The BGA is more efficient, but less parallel. We will show the power of the PGA with one application-the graph partitioning problem. Springer, 1996 Wuhan University Journal of Natural Sciences Wuhan University 1/3-4(1996-12-01), 630-639 1007-1202 1:3-4<630 1996 1 11859 https://doi.org/10.1007/BF02900898 text/html Onlinezugriff via DOI 1 research-article jats NATIONALLICENCE 856 40 https://doi.org/10.1007/BF02900898 text/html Onlinezugriff via DOI NATIONALLICENCE 100 1- Mühlenbein Heinz GMD FZ Informationstechnik, D-53754, Sankt Augustin aut NATIONALLICENCE 773 0- Wuhan University Journal of Natural Sciences Wuhan University 1/3-4(1996-12-01), 630-639 1007-1202 1:3-4<630 1996 1 11859 Metadata rights reserved Springer special CC-BY-NC licence nationallicence BK010053 XK010053 XK010000 NATIONALLICENCE NATIONALLICENCE NL-springer