On the Scalability of Parallel Genetic Algorithms

This paper examines the scalability of several types of parallel genetic algorithms (GAs). The objective is to determine the optimal number of processors that can be used by each type to minimize the execution time. The first part of the paper considers algorithms with a single population. The investigation focuses on an implementation where the population is distributed to several processors, but the results are applicable to more common masterslave implementations, where the population is entirely stored in a master processor and multiple slaves are used to evaluate the fitness. The second part of the paper deals with parallel GAs with multiple populations. It first considers a bounding case where the connectivity, the migration rate, and the frequency of migrations are set to their maximal values. Then, arbitrary regular topologies with lower migration rates are considered and the frequency of migrations is set to its lowest value. The investigationis mainly theoretical, but experimental evidence with an additively-decomposable function is included to illustrate the accuracy of the theory. In all cases, the calculations show that the optimal number of processors that minimizes the execution time is directly proportional to the square root of the population size and the fitness evaluation time. Since these two factors usually increase as the domain becomes more difficult, the results of the paper suggest that parallel GAs can integrate large numbers of processors and significantly reduce the execution time of many practical applications.

[1]  David E. Goldberg,et al.  Efficient Parallel Genetic Algorithms: Theory and Practice , 2000 .

[2]  Heinz Mühlenbein,et al.  Parallel Genetic Algorithms, Population Genetics, and Combinatorial Optimization , 1989, Parallelism, Learning, Evolution.

[3]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

[4]  Hans-Georg Beyer,et al.  Toward a Theory of Evolution Strategies: Some Asymptotical Results from the (1,+ )-Theory , 1993, Evolutionary Computation.

[5]  Reiko Tanese,et al.  Parallel Genetic Algorithms for a Hypercube , 1987, ICGA.

[6]  A. D. Bethke,et al.  Comparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacity , 1976 .

[7]  D. Goldberg,et al.  Predicting Speedups of Idealized Bounding Cases of Parallel Genetic Algorithms , 1997 .

[8]  Bernard Manderick,et al.  Fine-Grained Parallel Genetic Algorithms , 1989, ICGA.

[9]  Erick Cantú-Paz,et al.  Modeling Idealized Bounding Cases of Parallel Genetic Algorithms , 1996 .

[10]  E. Cantu-Paz,et al.  The Gambler's Ruin Problem, Genetic Algorithms, and the Sizing of Populations , 1997, Evolutionary Computation.

[11]  Erick Cantú-Paz,et al.  Migration Policies, Selection Pressure, and Parallel Evolutionary Algorithms , 2001, J. Heuristics.

[12]  Erick Cantú-Paz,et al.  Topologies, Migration Rates, and Multi-Population Parallel Genetic Algorithms , 1999, GECCO.

[13]  David E. Goldberg,et al.  Predicting Speedups of Ideal Bounding Cases of Parallel Genetic Algorithms , 1997, ICGA.

[14]  W. Punch,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problems , 1997 .

[15]  Zbigniew Michalewicz,et al.  Evolutionary Computation 1 , 2018 .

[16]  Kalyanmoy Deb,et al.  Genetic Algorithms, Noise, and the Sizing of Populations , 1992, Complex Syst..

[17]  Erik D. Goodman,et al.  A Genetic Algorithm Approach to Dynamic Job Shop Scheduling Problem , 1997, ICGA.

[18]  H. Leon Harter,et al.  Order statistics and their use in testing and estimation , 1970 .

[19]  Masaharu Munetomo,et al.  An Efficient Migration Scheme for Subpopulation-Based Asynchronously Parallel Genetic Algorithms , 1993, ICGA.

[20]  Paul Bryant Grosso,et al.  Computer Simulations of Genetic Adaptation: Parallel Subcomponent Interaction in a Multilocus Model , 1985 .

[21]  Heinrich Braun,et al.  On Solving Travelling Salesman Problems by Genetic Algorithms , 1990, PPSN.

[22]  E. Cant.  Migration Policies and Takeover Times in Parallel Genetic Algorithms , 1999 .

[23]  David E. Goldberg,et al.  Two analysis tools to describe the operation of classifier systems , 1989 .

[24]  Martina Gorges-Schleuter,et al.  ASPARAGOS An Asynchronous Parallel Genetic Optimization Strategy , 1989, ICGA.

[25]  Erick Cant,et al.  A Markov Chain Analysis of Parallel Genetic Algorithms with Arbitrary Topologies and Migration Rates , 1998 .