Learning in genetic algorithms

  • Erol Gelenbe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1478)


Learning in artificial neural networks is often cast as the problem of “teaching” a set of stimulus-response (or input-output) pairs to an appropriate mathematical model which abstracts certain known properties of neural networks. A paradigm which has been developed independently of neural network models are genetic algorithms (GA). In this paper we introduce a mathematical framework concerning the manner in which genetic algorithms can learn, and show that gradient descent can be used in this frameork as well. In order to develop this theory, we use a class of stochastic genetic algorithms (GA) based on a population of chromosomes with mutation and crossover, as well as fitness, which we have described earlier in [18].


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bharucha-Reid, A.T. “Elements of the Theory of Markov Processes and their Applications,” McGraw-Hill, New York (1960).zbMATHGoogle Scholar
  2. 2.
    Kernighan, B. and Lin, S. “An efficient heuristic procedure for partitioning graphs”, The Bell System Technical Journal, (February 1970).Google Scholar
  3. 3.
    Holland, J. “Adaptation in Natural and Artificial Systems,” The University of Michigan Press, Ann Arbor, Michigan (1975).Google Scholar
  4. 4.
    De Jong, Kenneth A. “An Analysis of the Behaviour of a Class of Genetic Adaptive Systems”, Doctoral Thesis, Department of Computer and Communication Sciences, University of Michigan, Ann Arbor (1975).Google Scholar
  5. 5.
    Gelenbe, E. and Mitrani, I. “Analysis and Synthesis of Computer Systems”, Academic Press, New York and London (1980).zbMATHGoogle Scholar
  6. 6.
    Gelenbe, E. and Pujolle, G. “Introduction to Networks of Queues”, J. Wiley and Sons, New York and London (1988), 2nd Edition (1998).Google Scholar
  7. 7.
    Muehlenbein, H., Schleuter, G. and Kramm, D. “Evolution algorithms in combinatorial optimization”, Parallel Computing, Vol 7, No 2, (1988).Google Scholar
  8. 8.
    Goldberg, D. “Genetic Algorithms in Search, Optimization and Machine Learning”, Addison Wesley, New York (1989).zbMATHGoogle Scholar
  9. 9.
    Gelenbe, E. “Multiprocessor Performance”. J. Wiley and Sons, New York and London (1989).zbMATHGoogle Scholar
  10. 10.
    Talbi, E. and Bessière, P. “Un algorithme génétique massivement parallèle pour le problème de partitionement de graphes”. Rapport de recherche. Laboratoire de Génie Informatique de Grenoble (1991).Google Scholar
  11. 11.
    Vose, M.D. and Liepins, G.E. “Punctuated equilibria in genetic search”, Complex Systems, Vol. 5, (1991) 31–44.zbMATHMathSciNetGoogle Scholar
  12. 12.
    Vose, M.D. “Formalizing genetic algorithms”, Technical Report (CS-91-127), Department of Computer Science, The University of Tennessee (1991).Google Scholar
  13. 13.
    Vose, M.D. “Modeling simple genetic algorithms”, in Whitley, L. Darrell ed.), “Foundations of Genetic Algorithms 2”, Morgan Kaufmann, San Mateo (1993).Google Scholar
  14. 14.
    Gelenbe, E. “Learning in the recurrent random neural network”, Neural Computation, Vol. 5, No. 1, (1993) 154–164.MathSciNetGoogle Scholar
  15. 15.
    Medhi, J. “Stochastic Processes,” 2nd Edition, Wiley Eastern Ltd, New Delhi (1994).zbMATHGoogle Scholar
  16. 16.
    Gunther, R. “Convergence analysis of canonical genetic algorithms”, IEEE Transactions on Neural Networks, Vol. 5, No. 1, (1994) 96–101.CrossRefGoogle Scholar
  17. 17.
    Xiaofeng Qui, Palmieri, F. “Theoretical analysis of evolutionary algorithms with infinite population size, Parts I and II”, IEEE Transactions on Neural Networks, Vol. 5, No. 1, 102–129, 1994.CrossRefGoogle Scholar
  18. 18.
    Gelenbe, E. “A class of genetic algorithms with analytical solution”, Robotics and Autonomous Systems, Vol. 22, (1997) 59–64.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Erol Gelenbe
    • 1
  1. 1.Department of Electrical and Computer EngineeringDuke UniversityDurham

Personalised recommendations