Parallel genetic algorithms, population genetics and combinatorial optimization

  • H. Mühlenbein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 565)


In this paper we introduce our asynchronous parallel genetic algorithm ASPARAGOS. The two major extensions compared to genetic algorithms are the following. First, individuals live on a 2-D grid and selection is done locally in the neighborhood. Second, each individual does local hill climbing. The rationale for these extensions is discussed within the framework of population genetics. We have applied ASPARAGOS to an important combinatorial optimization problem, the quadratic assignment problem. ASPARAGOS found a new optimum for the largest published problem. It is able to solve much larger problems. The algorithm uses a polysexual voting recombination operator.


Genetic Algorithm Travel Salesman Problem Travel Salesman Problem Quadratic Assignment Problem Island Model 
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. [Ack87]
    Ackley D. H. An Empirical Study of Bit Vector Function Optimization. in Dav87, 87.Google Scholar
  2. [Axe87]
    Axelrod R. The Evolution of strategies in the Iterated Prisoner's Dilemma. in Dav87, 87.Google Scholar
  3. [BR84]
    Burkard R. E., Rendl F. A thermodynamically motivated simulation procedure for combinatorial optimization problems. Europ. Journ. of Operat. Research, 17:169–174, 84.Google Scholar
  4. [Bur84]
    Burkard R. Quadratic Assignment Problems. Europ. Journal of Operations Research, 15:283–289, 84.Google Scholar
  5. [C*87]
    Cohoon D. P. et al. Punctuated Equilibria: A Parallel Genetic Algorithm. in Gre87, 87.Google Scholar
  6. [Cro86]
    Crow J. E. Basic Concepts in Population, Quantitative, and Evolutionary Genetics. Freeman, New York, 86.Google Scholar
  7. [Dar59]
    Darwin C. The Origin of Species by Means of Natural. Penguin Books, London, 1859.Google Scholar
  8. [Dav87]
    Davis L. Genetic Algorithms and Simulated Annealing. Morgan Kaufmann, Los Altos, 87.Google Scholar
  9. [DJ80]
    De Jong K. Adaptive system design: A genetic approach. IEEE Trans. Syst., Man and Cybern., 10:566–574, 80.Google Scholar
  10. [Gol89]
    Goldberg D. E. Genetic Algorithms in Search, Optimization, and Machine Learning. Adison-Wesley, 89.Google Scholar
  11. [Gor89]
    Gorges-Schleuter M. ASPARAGOS: Simulation of the TSP. to be published, 89.Google Scholar
  12. [Gre87]
    Grefenstette J. J., editor. Genetic Algorithms and their Applications, Hillsdale Lawrence Erlbaum Ass., Proc. 2nd Conf. on Genetic Algorithms, 87.Google Scholar
  13. [Hol75]
    Holland J. H. Adaptation in natural and artificial systems. Ann Arbor, University of Michigan Press, 75.Google Scholar
  14. [Lin65]
    Lin S. Computer solution of the traveling salesman problem. Bell. Sys, Tech. Journ., 44:2245–2269, 65.Google Scholar
  15. [MGK88]
    Mühlenbein H., Gorges-Schleuter M., Krämer O. Evolution Algorithms in Combinatorial Optimization. Parallel Computing, 7(1):65–88, 88.Google Scholar
  16. [MK89]
    Mühlenbein H., Kindermann J. The Dynamics of Evolution and Learning — Towards Genetic Neural Networks. in: Connectionism in Perspectives, J. Pfeiffer ed., 89Google Scholar
  17. [MKPR89]
    Mühlenbein H., Krämer O., Peise G., Rinn R. The MEGAFRAME HYPERCLUSTER — A Reconfigurable Architecture for Massively Parallel Computers. 89. to be published.Google Scholar
  18. [MS87]
    Maynard Smith J. When learning guides evolution. Nature, 329:761–762, 87.Google Scholar
  19. [Nap89]
    Napierala G. Ein paralleler Ansatz zur Lösung des TSP. Diplomarbeit, University Bonn, Jan 89.Google Scholar
  20. [Nat88]
    Nature. Scientific correspondence. Nature 336, 527–528, 88.Google Scholar
  21. [P*87]
    Pettey C. B. et al. A parallel genetic algorithm. in Gre87, 87.Google Scholar
  22. [Spi88]
    Spiessens P. Genetic Algorithms. AI-MEMO 88-19, VUB Brussels, 88.Google Scholar
  23. [SR86]
    Sheraldi H. D., Rajgopal P. A Flexible, Polynomialtime Construction and Improvement Heuristic for the Quadratic Assignment Problem. Operations Research, 13:587–600, 86.Google Scholar
  24. [Tan87]
    Tanese R. Parallel Genetic Algorithms for the Hypercube. in Gre87, 87.Google Scholar
  25. [Wri32]
    Wright S. The Roles of Mutation, Inbreeding, Crossbreeding and Selection in Evolution. In Proc. 6th Int. Congr. Genetics, pages 356–366, 32.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • H. Mühlenbein
    • 1
  1. 1.GMDSt. Augustin 1

Personalised recommendations