GAS, a concept on modeling species in genetic algorithms

  • Márk Jelasity
  • József Dombi
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1063)


This paper introduces a niching technique called GAS (S stands for species) which dinamically creates a subpopulation structure (taxonomic chart) using a radius function instead of a single radius, and a ‘cooling’ method similar to simulated annealing. GAS offers a solution to the niche radius problem with the help of these techniques. A method based on the speed of species is presented for determining the radius function. Speed functions are given for both real and binary domains. We also discuss the sphere packing problem on binary domains using some tools of coding theory to make it possible to evaluate the output of the system. Finally two problems are examined empirically. The first is a difficult test function with unevenly spread local optima. The second is an NP-complete combinatorial optimization task, where a comparison is presented to the traditional genetic algorithm.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    F.J. MacWilliams, N.J.A. Sloan (1977) The Theory of Error-correcting Codes. North Holland.Google Scholar
  2. [2]
    R.J. McEliece (1977) The Theory of Information and Coding., Addison-Wesley.Google Scholar
  3. [3]
    V. Csányi (1982) General Theory of Evolution. Publ. House of the Hung. Acad. Sci. Budapest.Google Scholar
  4. [4]
    R.A. Caruana, J.D. Schaffer (1988), Representation and hidden bias: Gray vs. binary coding for genetic algorithms, in Proceedings of the fifth international conference on machine learning (editor: John Laird), pp 153–161.Google Scholar
  5. [5]
    K. Deb (1989) Genetic algorithms in multimodal function optimization. Masters thesis, TCGA Report No. 89002. The University of Alabama, Dep. of Engineering mechanics.Google Scholar
  6. [6]
    K. Deb, D.E. Goldberg (1989) An investegation of niche and species formation in genetic function optimization. In Proceedings of the Third ICGA (pp42–50). Morgan Kaufmann.Google Scholar
  7. [7]
    D. E. Goldberg (1989), Genetic algorithms in search, optimization and machine learning, Addison-Wesley, ISBN 0-201-15767-5.Google Scholar
  8. [8]
    A. Törn, A. Źilinskas (1989), Global Optimization, in Lecture Notes in Computational Science 350. Springer-Verlag.Google Scholar
  9. [9]
    Y. Davidor (1991) A naturally occuring niche and species phenomeon: the model and first results. In Proceedings of the Fourth ICGA (pp257–263). Morgan Kaufmann.Google Scholar
  10. [10]
    G.J.E. Rawlins (ed.) (1991) Foundations of Genetic Algorithms., Morgan Kaufmann.Google Scholar
  11. [11]
    G. Syswerda (1991) A Study of Reproduction in Generational and Steady State Genetic Algorithms. in [10].Google Scholar
  12. [12]
    J.H. van Lint (1992) Introduction to Coding Theory., Springer-Verlag.Google Scholar
  13. [13]
    D. Beasley, D.R. Bull, R.R. Martin (1993) A Sequential Niche Technique for Multimodal Function Optimization. Evolutionary Computation 1(2), pp101–125, MIT Press.Google Scholar
  14. [14]
    S. Khuri, T. Bäck, J. Heitkötter (1993), An Evolutionary Approach to Combinatorial Optimization Problems, in The Proceedings of CSC'94.Google Scholar
  15. [15]
    M. Jelasity, J. Dombi (1995) GAS, an Approach to a Solution of the Niche Radius Problem. In The proceedings of GALESIA'95.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Márk Jelasity
    • 1
  • József Dombi
    • 2
  1. 1.Student of József Attila UniversitySzegedHungary
  2. 2.Department of Applied InformaticsJózsef Attila UniversitySzegedHungary

Personalised recommendations