Grammar-based model of Hierarchical Genetic Strategy - a preliminary study

• Autorzy: Kołodziej J.
• Konferencja: Evolutionary Computation and Global Optimization 2008 / National Conference (11 ; 2-4.06.2008 ; Szymbark, Poland)
• Języki publikacji: EN

Abstrakty

EN

The scope of this paper is the construction of Hierarchical Genetic Strategy theoretical model based on the L-systems framework. The model was defined in the case of inactive prefix comparison procedure of HGS. We applied Vose's theory in a short formal analysis of basic search mechanisms implemented in the strategy.

Słowa kluczowe

EN

L system; Lindenmayer system; simple genetic algorithm; SGA; Hierarchical Genetic Strategy; HGS; genetic algorithm; evolutionary computation

PL

L-system; system Lindenmayera; algorytm genetyczny; obliczenia ewolucyjne

• Wydawca: Oficyna Wydawnicza Politechniki Warszawskiej
• Czasopismo: Prace Naukowe Politechniki Warszawskiej. Elektronika
• Rocznik: 2008
• Tom: z. 165
• Strony: 95--102
• Opis fizyczny: Bibliogr. 15 poz., rys.

Twórcy

autor

Kołodziej J.

• University of Bielsko-Biała, Department of Mathematics and Computer Science, Bielsko-Biała, Poland,

Bibliografia

• [1] K.B. Athreya and P.E. Ney. Branching processes. Springer Verlag, 1972.
• [2] D.E Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, 1989.
• [3] M. Iosifescu. Finite Markov processes and its applications. Polish ed. PWN, 1988.
• [4] R. Gwizdała, J. Kołodziej and J. Wojtusiak. Hierarchical genetic strategy as a method of improving search efficiency. Advances in Multi-Agent Systems, R. Schaefer and S. Sędziwy (Eds.), UJ Press, Cracow, pages 149-161, 2001.
• [5] C. Jacob. Genetic l-system programming. In PPSN III - Parallel Problem Solving from Nature, International Conference on Evolutionary Computation, LNCS 866, Springer-Vlg, Berlin, pages 334-343, 1994.
• [6] C. Jacob and J. Rehder. Evolution of neutral net architectures by a hierarchical grammar-based genetic system. In ICANNGA'93, Innsbruck, Springer Vlg., Wien, pages 602-606, 1993.
• [7] J. Kołodziej. Modelling hierarchical genetic strategy as a family of markov chains. In R. Wyrzykowski, J. Dongarra, M. Paprzycki and J. Waśniewski (eds.), Parallel Processing and Applied Mathematics, LNCS, vol. 2328, Springer Vlg, pages 595-599, 2002.
• [8] J.R. Koza. Genetic Programming. Part 1, Part 2. MIT Press, 1992 (Part 1), 1994 (Part 2).
• [9] P. Prusinkiewicz and A. Lindenmayer. The Algorithmic Beauty of Plants. Springer Vlg, 1990.
• [10] G. Rudolph. Stochastic processes. Handbook of Evolutionary Computation B2.2, 1997.
• [11] R. Schaefer and K. Adamska. On genetic clustering using finite mixture models - error estimation and practical tests. In Proc. of KAEiOG 2003, Łagów Lubuski. 26-28.05.03, pages 183-191, 2003.
• [12] R. Schaefer and J. Kołodziej. Genetic search reinforced by the population hierarchy. FOGA VII, Morgan Kaufmann, pages 383 401, 2003.
• [13] H.-P. Schwefel, T. Back. Evolution strategies I, in J. Periaux, G. Winter (eds.) Genetic algorithms in engineering and computer science. J. Wiley, 1995.
• [14] M.D. Vose and G. E. Liepins. Punctuated equilibria in genetic search. Complex Systems, 5:31-34, 1991.
• [15] M.D. Vose. The Simple Genetic Algorithm. MIT press, 1999.