Simple taxonomy of the genetic global optimization

• Autorzy: Schaefer R.
• Języki publikacji: EN

Abstrakty

EN

The paper tries to show the role that can be played by genetic optimization strategies in solving huge global optimization problems in computational mechanics and other branches of high technology. Genetic algorithms are especially recommended as the first phase in two-phase stochastic optimization. The self-adaptability of genetic search is shown on the basis of the mathematical model introduced by M. Vose. Main goals of adaptation are used as leading criteria in the simple taxonomy of genetic strategies.

Słowa kluczowe

EN

genetic algorithm

PL

algorytm genetyczny

• Wydawca: Instytut Podstawowych Problemów Techniki PAN
• Czasopismo: Computer Assisted Mechanics and Engineering Sciences
• Rocznik: 2002
• Tom: Vol. 9, No. 1
• Strony: 135--149
• Opis fizyczny: Bibliogr. 46 poz., rys., tab.

Twórcy

autor

Schaefer R.

• Uniwersytet Jagielloński, Instytut Informatyki, ul. Nawojki 11, 30-072 Kraków

Bibliografia

• [1] R.W. Anderson. The Baldwin effect. C3.4.1. in [42].
• [2] J. Arabas, Z. Michalewicz, J. Mulawka. GAVaPS — a genetic algorithm with varying population size. Proc. of the 1st IEEE Conf. on Evolutionary Computation, Orlando, FL, June I 994, pp. 73-78. Piscataway, NJ, IEEE, 1994.
• [3] J. Arabas. Lectures on Evolutionary Algorithms (in Polish). WNT, 2001.
• [4] T. Bäck. Mutation parameters. E1.2 in [6].
• [5] T. Bäck. Self-adaptation. C7.1 in [6].
• [6] T. Bäck, D.B. Fogel, Z. Michalewicz, eds. Handbook of Evolutionary Computation. Oxford Univ. Press, New York, Oxford, 1997.
• [7] D. Beasley, D.R. Bull, RER. Martin. A sequential niche technique for multimodal function optimization. Evolutionary Computation, 1(2): 101-125, 1993.
• [8] T. Burczyński, P. Orantek. "The composition of genetic and gradient algorithms (in Polish). Proc. of the KAEGiOG'99, Potok Złoty 1999, pp. 47—54, 1999.
• [9] Cabib, R. Schaefer, H. Telega. A parallel genetic clustering for inverse problems. Lecture Notes in Computer Science 1541, pp. 551-556. Springer, 1998.
• [10] L. Davis. Adapting operator probabilities in genetic algorithms. In: J.D. Schaeffer, ed., Proc. of 3rd Int. Conf. on Genetic Algorithms, Fairfaz, VA, June 1989, pp. 61-69. San Mateo, CA, Morgan Kaufman, 1989.
• [11] K.A. De Jong. An Analysis of the Behavior of a class of Genetic Adaptive Systems. PhD Thesis, University of Michigan, 1970.
• [12] W. Feller. An Introduction to Probability, Theory and its Applications, vol. I, 3rd ed., vol. II, 2nd ed. J. Wiley, NY, 1968, 1971; Polish ed.: PWN, Warszawa, 1987.
• [13] T.C. Fogarty. Varying the probability ot mutation in the genetic algorithm. In: J.D. Schaeffer, ed., Proc. of 3rd Int. Conf. on Genetic Algorithms, Fairfaz, VA, June 1989, pp. 104-109. San Mateo, CA, Morgan Kaufman, 1989.
• [14] B. Friesleben. Metaevolutionary approaches. C7.2 in [6].
• [15] R. Galar, R. Kopciuch. Impatience and polarization in evolutionary processes (in Polish). Proc. of the KAEGiOG'99, Potok Złoty 1999, pp. 115-122, 1999.
• [16] R. Galar. The practice of governing of research and development processes in light of experience in evolutionary algorithms (in Polish). Proc. of the KAGiOG'97 (Tutorial), Rytro 1997, pp. 7-22, 1997.
• [17] D. Goldberg, J. Richardson. Genetic algorithms with sharing for multimodal function optimization. Genetic Algorithms and their Applcations. Proc. of the 2nd Int. Conf. on Genetic Algorithms, pp. 41-49, 1987.
• [18] D.E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Adisson Wesley, 1980.
• [19] K. Grygiel. On asymptotic properties of a selection-with-mutation operator, Proc. of the 1st Polish Conference on Evolutionary Algorithms, Murzasichle, 1996.
• [20] R. Horst, P.M. Pardalos. Handbook of Global Optimization. Kluwer Academic Publishers, 1995.
• [21] M. Littman, D. Adaptative in constant utility nonstationary. Proc. Of ICGA'91 Conf. Morgan Kaufman Publisher, 1991.
• [22] W.N Martin, J . Lienig, J.P. Cohoon. Island (migration) models: evolutionary algorithms based on punctuated equilibria. C6.3 in [6].
• [23] Z. Michalewicz. Genetic algorithms + Data Structures = Evolution Programs. Springer, 1996.
• [24] A.E. Nix, M.D. Vose. Modeling genetic algorithms with Markov chains. Annals of Mathematics and Artificial Intelligence, 5(1): 79-88, 1992.
• [25] A. Obuchowicz, J. Korbicz. Evolutionary search with soft selection algorithms in parameter optimization. Proc. of the Conf. PPAM'99, Kazimierz Dolny, Poland, 1999.
• [26] A. Obuchowicz, K. Patan. An algorithm of evolutionary search with soft selection for training multilayered feedforeward naural networks. Proc. of 3rd Conf. Neural Networks and their Application, KSN'97, Kule, Poland, pp. 123-128, 1997.
• [27] A. Obuchowicz. Adaption in time-varying landscape using an evolutionary search with soft selection algorithm. Proc. of the KAEGiQ0G'99, Potok Złoty 1999, pp. 245-251, 1999.
• [28] A. Obuchowicz. The evolutionary search with soft selection and deterioration of the objective function. Proc. of the 6th Int. Symp. Intelligent Information Systems, IIS'97, Zakopane, Poland, pp. 288-295, 1997.
• [29] A. Pelczar. Introduction to the Theory of Differential Equations, Part II: The Qualitative Theory of Differential Equations, (in Polish). PWN, Warszawa, 1980.
• [30] R. Schaefer, Z.J. J abłoński. On the convergence of sampling measures in the global genetic search. Submitted to the Proceedings of PPAM'01, September. 2000.
• [31] R. Schaefer, J. Kołodziej R. Gwizdała, J. Wojtusiak. How simpletons can increase the community development - an attempt to hierarchical genetic computation. Proc. of the KAEGiOG'2K, Lądek Zdrój 2000, pp. 187-198, 2000.
• [32] R. Schaefer, H. Telega, J. Kołodziej. Genetic algorithm as a Markov dynamic system. Proc. of the Int. Conf. on Intelligent Techniques in Robotics, Control and Decision Making, 22-23 February 1999, pp. 82-86. Polish-Japanese Institute of Information Technology Press, Warsaw, 1999.
• [33] R. Schaefer, H. Telega. Advantages and drawbacks of a genetic clustering strategy. Proc. of the KAEGiOG’99, Potok Złoty 1999, pp. 291-300, 1999
• [34] R. Schaefer, H. Telega. Testing the Genetic Clustering with SGA evolutionary engine. Proc. of the KAEGiOG’99, Lądek Zdrój 2000, pp. 227-236, 2000.
• [35] D Schlierkamp-Voosen, H. Miichlenbein. Adaptation of population sizes by competing subpopulation. Proc. of the 1st IEEE Conf. on Evolutionary Computation, Orlando, FL, June 1996, pp. 330-335. Piscataway, NJ, IEEE, 1996.
• [36] F Seredyński. New trends in parallel and distributed evolutionary computing. Fundamenta Informaticae, 35: 211-230, 1998.
• [37] S. Smith. The simplex method and evolutionary algorithms. Proc of ICEC'98 Conf., Alaska USA, May 1998, IEEE Press, 1998
• [38] W.M. Spears. Simple subpopulation schemes. Proc. of rd Annual Conf. on Evolutionary Programming, San Diego. CA, pp. 296-307. World Scientific, 1994.
• [39] J. Stańczak. Concept and Algorithms Development for Self Adapting Evolutionary Systems, (in Polish). PhD Thesis, Warsaw University of Technology, Warszawa, 1999.
• [40] J. Stańczak. Evolutionary algorithm with population of "smart” solutions (in Polish). Proc. of the KAEGiOG’2K, Lądek Zdrój 2000, pp. 207-218.
• [41] H. Telega. Parallel Algorithms for Solving Selected Inverse Problems (in Polish). PhD Thesis, Academy of Minig and Metalurgy, Cracow, Poland, 1999.
• [42] M.D. Vose, A.D. Wright. Stability of vertex fixed points and applications. Evolutionary Computattons, 1995.
• [43] M.D. Vose. Formalizing genetic algorithms. Proc. IEEE wrksp. on GAs, NNs & SA Applied to Problems Signal and Image Processing. Glasgow, U.K., May 1990.
• [44] M. Vose. The simple genetic algorithm. MIT Press 1999.
• [45] D. Whitley, V. Gordon, K. Mathias. Lamarckian evolution, the Baldwin effect and function optimization. In: Y. Davidor, H.P. Gchwefel, eds., Proc. Of PPSN'94, Berlin, July 1 992. Springer-Verlag, 1992.
• [46] D. Whitley, R. Soraya, R_B. Heckerdorn. Island model genetic algorithms and linearly separable problems. Proc. of AISB 1997 Workshop on Evoluttonary Computing, Manchester, PP. 112-129, 1997.