Combining Distributed Populations and Periodic Centralized Selections in Coarse-Grain Parallel Genetic Algorithms

  • R. Bianchini
  • C. M. Brown
  • M. Cierniak
  • W. Meira


In this paper we demonstrate that parallel genetic algorithms can profit from performing periodic centralized selections of distributed populations. With this combination, implementations can benefit from the variety of environments provided by distributed approaches, while periodically being able to consider the population as a whole and disregard very unfit individuals. We study four different parallel genetic algorithm implementation strategies; each of them striking a different balance between centralization and distribution. These strategies are applied to several well-known benchmark problems. Our results show that the implementations using periodic centralized selections exhibit remarkable robustness in terms of their search quality, while keeping running time overheads under control. Our main conclusion is that performing centralized selections represents an improvement to the traditional population distribution approaches, which are susceptible to somewhat inefficient search.


Genetic Algorithm Travel Salesman Problem Centralize Selection Integer Linear Programming Problem Parallel Genetic Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    S. Baluja. Structure and performance of fine-grain parallelism in genetic search. In Proc. of the 5th Int. Conf. on Genetic Algorithms and their Applications, pages 155–162, 1993.Google Scholar
  2. [2]
    R. Bianchini and C. Brown. Parallel genetic algorithms on distributed-memory architectures. In Transputer: Research and Applications, May 1993.Google Scholar
  3. [3]
    J. P. Cohoon, W. N. Martin, and D. S. Richards. A multi-population genetic algorithm for solving the k-partition problem on hyper-cubes. In Proc. of the 3rd Int. Conf. on Genetic Algorithms and their Applications, 1989.Google Scholar
  4. [4]
    R. J. Collins and D. R. Jefferson. Selection in massively parallel genetic algorithms. In Proc. of the 4th Int. Conf. on Genetic Algorithms and their Applications, pages 249–256, 1991.Google Scholar
  5. [5]
    R. J. Fowler and L. I. Kontothanassis. Mercury: Object-affinity scheduling and continuation passing on multiprocessors. In Parallel Architectures and Languages Europe (PARLE)’94, June 1994.Google Scholar
  6. [6]
    D. E. Goldberg. Genetic Algorithms in search, optimization and machine learning. Addison-Wesley, 1989.MATHGoogle Scholar
  7. [7]
    J. J. Grefenstette. Parallel adaptive algorithms for function optimization. Technical Report CS-81-19, Nashville: Vanderbilt University. Computer Science Dept., 1981.Google Scholar
  8. [8]
    K. A. De Jong. Analysis of the Behavior of a Class of Genetic Algorithms. PhD thesis, University of Michigan, 1975.Google Scholar
  9. [9]
    V. Kommu and I. Pomeranz. Effect of communication in a parallel genetic algorithm. In Proc. of the 1992 Int. Conf. on Parallel Processing, pages III:310–317, 1992.Google Scholar
  10. [10]
    P. Neuhaus. Solving the mapping-problem — experiences with a genetic algorithm. In Parallel Problem Solving from Nature, pages 170–175. Springer-Verlag, 1991.CrossRefGoogle Scholar
  11. [11]
    H. A. Taha. Integer Programming — Theory, Applications and Computations. Academic Press, 1975.MATHGoogle Scholar
  12. [12]
    R. Tanese. Distributed genetic algorithms. In Proc. of the 3rd Int. Conf. on Genetic Algorithms and their Applications, 1989.Google Scholar

Copyright information

© Springer-Verlag/Wien 1995

Authors and Affiliations

  • R. Bianchini
    • 1
  • C. M. Brown
    • 1
  • M. Cierniak
    • 1
  • W. Meira
    • 1
  1. 1.Department of Computer ScienceUniversity of RochesterRochesterUSA

Personalised recommendations