Program Construction in the Context of Evolutionary Computation

  • Jelena Sanko
  • Jaan Penjam
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2890)


Many optimization algorithms that imitate certain principles of nature have been proven useful in various application domains. The following paper shows how Evolutionary Algorithm (EA) can be applied to model (program) construction for solving the discrete time system identification problem. Non-linear system identification is used as an example problem domain for studying possibilities of EA to discover the relationship between parameters in response to a given set of inputs.


Genetic Algorithm Evolutionary Algorithm Genetic Programming Evolutionary Computation Symbolic Regression 
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.
    Bäck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. IOP Publ. Co. & Oxford University Press (1997)Google Scholar
  2. 2.
    Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1996)zbMATHGoogle Scholar
  3. 3.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  4. 4.
    Koza, J.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge (1992)zbMATHGoogle Scholar
  5. 5.
    Banzhaf, W., Nordin, P., Keller, R.E., Francone, F.D.: Genetic Programming. In: An Introduction On the Automatic Evolution of Computer Programs and Its Applications. Morgan Kaufmann Publishers, Inc., San Francisco (1998)Google Scholar
  6. 6.
    Langdon, W.B., Poli, R.: Foundations of Genetic Programming. Springer, Heidelberg (2002)zbMATHGoogle Scholar
  7. 7.
    Tyugu, E.: Knowledge-Based Programming. Addison-Wesley Publishing Company, Inc, Reading (1988)Google Scholar
  8. 8.
    Söderström, T., Stoica, P.: System Identification. Prentice Hall International, London (1989)zbMATHGoogle Scholar
  9. 9.
    Tan, K.C., Li, Y., Murray-Smith, D.J., Sharman, K.: System identification and linearisation using genetic algorithms with simulated annealing. In: First Int. Conf. On CALESIA. University of Sheffield, UK (1995)Google Scholar
  10. 10.
    Kristinsson, K., Dumont, G.A.: Genetic Algorithms in system identification. In: Third IEEE Int. Symp. Intelligent Contr., Arlington, VA, pp. 597–602 (1988)Google Scholar
  11. 11.
    Iba, H.: System identification using structured genetic algorithms. In: Handbook of Evolutionary Computation, vol. G1.4, pp. 1–11. IOP Publ. Co. & Oxford University Press (1997)Google Scholar
  12. 12.
    Kotta, Ü., Nõmm, S., Chowdhury, F.N.: On a new type of neural-network-based input-output model: the ANARMA structure. IFAC (2001)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Jelena Sanko
    • 1
  • Jaan Penjam
    • 1
  1. 1.Institute of Cybernetics at TTUTallinnEstonia

Personalised recommendations