Advertisement

Eco-Grammar Systems as Models for Parallel Evolutionary Algorithms

  • Adrian Horia Dediu
  • María Adela Grando
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3777)

Abstract

Evolutionary Algorithms (EAs), biological inspired searching techniques, represent a research domain where theoretical proofs are still missing. Due to the lack of theoretical foundations, an extensive experimental work developed many variations of the basic model. Remarkable tendencies such as variable control parameters or parallel populations try to overcome the stagnation observed at the end of evolutions.

We tried to study from theoretical point of view the possibility of modelling parallel EAs using Eco-grammar systems. We expect that our research opens a new perspective over EAs behavior and our framework can bring theoretical results that will lead to new recommendations for EAs architectures as well as for specific details requested by practical problems.

Keywords

Genetic Algorithm Evolutionary Algorithm Genetic Operator Potential Parent Mathematical Linguistics 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bäck, T.: Evolutionary Algorithms in Theory and Practice - Evolution Strategies, Evolutionary Programming, Genetic Algorithms. Oxford University Press, Oxford (1996)zbMATHGoogle Scholar
  2. 2.
    Beasley, D., Bull, D.R., Martin, R.R.: An Overview of Genetic Algorithms, Part 1. Fundamentals, University Computing 15(2), 58–69 (1993)Google Scholar
  3. 3.
    Beasley, D., Bull, D.R., Martin, R.R.: An Overview of Genetic Algorithms, Part 2. Research topics, University Computing 15(4), 170–181 (1993)Google Scholar
  4. 4.
    Cantu-Paz, E.: A survey of Parallel Geneti Algorithms, IlliGAL Report No. 97003 (1997)Google Scholar
  5. 5.
    Csuhaj-Varjú, E., Kelemen, J., Kelemenová, A., Păun, G.: Eco-grammar systems: A grammatical framework for studying lifelike interactions. Artificial Life 3, 1–28 (1997)CrossRefGoogle Scholar
  6. 6.
    Dediu, A.H., Grando, M.A.: Simulating Evolutionary Algorithms with Eco-grammar Systems. In: Mira, J., Álvarez, J.R. (eds.) IWINAC 2005. LNCS, vol. 3562, pp. 112–121. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  7. 7.
    Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  8. 8.
    Michalewicz, Z.: Genetic Algorithms + data Structures = Evolution Programs. Springer, New York (1996)zbMATHGoogle Scholar
  9. 9.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)zbMATHGoogle Scholar
  10. 10.
    Sosík, P.: On eco-grammar systems and artificial neural networks. Computers and Artificial Intelligence 15, 247–264 (1996)zbMATHMathSciNetGoogle Scholar
  11. 11.
    Srinivas, M., Patnoik, L.M.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Transactions on Systems, Man and Cybernetics 24(4), 656–668 (1994)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Adrian Horia Dediu
    • 1
  • María Adela Grando
    • 1
  1. 1.Research Group on Mathematical LinguisticsRovira i Virgili UniversityTarragonaSpain

Personalised recommendations