Abstract
Mutation plays an important role in the computing of Genetic Algorithms (GAs). In this paper, we use the success probability as a measure of the performance of GAs, and apply a method for calculating the success probability by means of Markov chain theory. We define the success probability as there is at least one optimum solution in a population. In this analysis, we assume that the population is in linkage equilibrium, and obtain the distribution of the first order schema. We calculate the number of copies of the optimum solution in the population by using the distribution of the first order schema. As an application of the method, we study the GA on the multiplicative landscape, and demonstrate the process to calculate the success probability for this example. Many researchers may consider that the success probability decreases exponentially as a function of the string length L. However, if mutation is included in the GA, it is shown that the success probability decreases almost linearly as L increases.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Furutani, H., Zhang, Y., Sakamoto, M.: Study of the Distribution of Optimum Solution in Genetic Algorithm by Markov Chains. Transactions on Mathematical Modeling and its Applications (TOM) (to be published)
Ewens, J.W.J.: Mathematical Population Genetics. I. Theoretical Introduction, 2nd edn. Springer, New York (2004)
Nix, A.E., Vose, M.D.: Modelling Genetic Algorithm with Markov Chains. Annals of Mathematical and Artificial Intelligence 5, 79–88 (1992)
Davis, T.E., Principe, J.C.: A Markov Chain Framework for the Simple Genetic Algorithm. Evolutionary Computation 1, 269–288 (1993)
Imai, J., Shioya, H., Kurihara, M.: Modeling of Genetic Algorithms Based on the Viewpoint of Mixture Systems. Transactions on Mathematical Modeling and its Applications (TOM) 44(SIG 07), 51–60 (2003)
Asoh, H., Mühlenbein, H.: On the Mean Convergence Time of Evolutionary Algorithms without Selection and Mutation. In: Davidor, Y., Männer, R., Schwefel, H.-P. (eds.) PPSN 1994. LNCS, vol. 866, pp. 88–97. Springer, Heidelberg (1994)
Furutani, H.: Schema Analysis of Average Fitness in Multiplicative Landscape. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 934–947. Springer, Heidelberg (2003)
Crow, J.F., Kimura, M.: An Introduction to Population Genetics Theory. Harper and Row, New York (1970)
Zhang, Y., Sakamoto, M., Furutani, H.: Effects of Population Size on Performance of Genetic Algorithms and Roles of Crossover and Mutation. In: The Thirteenth International Symposium on Artificial Life and Robotics (AROB 13th 2008), pp. 861–864 (2008)
Zhang, Y., Sakamoto, M., Furutani, H.: Probability of Obtaining Optimum Solutions in Genetic Algorithm and Roles of Mutation. IPSJ SIG Technical Reports, 2008-MPS-68, vol. 2008(17), pp. 161–164 (2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer Tokyo
About this paper
Cite this paper
Zhang, Ya., Ma, Q., Sakamoto, M., Furutani, H. (2010). Effect of Mutation to Distribution of Optimum Solution in Genetic Algorithm. In: Peper, F., Umeo, H., Matsui, N., Isokawa, T. (eds) Natural Computing. Proceedings in Information and Communications Technology, vol 2. Springer, Tokyo. https://doi.org/10.1007/978-4-431-53868-4_43
Download citation
DOI: https://doi.org/10.1007/978-4-431-53868-4_43
Publisher Name: Springer, Tokyo
Print ISBN: 978-4-431-53867-7
Online ISBN: 978-4-431-53868-4
eBook Packages: Computer ScienceComputer Science (R0)