Abstract
Identifying the optimal settings for crossover probability p c and mutation probability p m is of an important problem to improve the convergence performance of GAs. In this paper, we modelled genetic algorithms as controlled Markov chain processes, whose transition depend on control parameters (probabilities of crossover and mutation). A stochastic optimization problem is formed based on the performance index of populations during the genetic search, in order to find the optimal values of control parameters so that the performance index is maximized. We have shown theoretically the existence of the optimal control parameters in genetic search and proved that, for the stochastic optimization problem, there exists a pure deterministic strategy which is at least as good as any other pure or mixed (randomized) strategy.
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.
Similar content being viewed by others
References
Goldberg, D. E.: Genetic algorithms in search, optimization and machine learning. Reading, Massachusetts, USA: Addison-Wesley. (1989)
Back, T.: Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press. (1996)
Back, T., Fogel, D. B. and Michalewicz, Z: Handbook of Evolutionary Computation. IOP Publishing Ltd and Oxford University Press, (1997)
Grefenstette, J. J.: Optimization of control parameters for genetic algorithms. IEEE Trans. on System, Man and Cybernetics, 16, (1986) 122–128
Schaffer, D. and Morishma, A.: An adaptive crossover mechanism for genetic algorithms. Proc. Second Int. Conf. Genetic Algorithms, (1987) 36–40
Davis, L.: Adapting operator probabilities in genetic algorithms. Proc. Third Int. Conf. on Genetic Algorithms. (1989) 61–69
Davis, T. E.: Toward an extrapolation of the simulated annealing convergence theory onto a simple genetic algorithm. Ph.D. thesis, University of Florida, USA (1991)
Fogarty, T. C.: Varying the probability of mutation in genetic algorithms. Proc. Third Int. Conf. on Genetic Algorithms, (1989) 104–109
Srinivas, M. and Patnaik, L. M.: Adaptive probabilities of crossover and mutation in genetic algorithms. IEEE Trans. on System, Man and Cybernetics. 24, (1994) 656–667
Bäck, T.: Self-adaptation in genetic algorithms. Proc. of the First European Conference on Artificial Life. MIT Press, (1992) 263–271
Hinterding, R.: Gaussian mutation and self-adaptation in numeric genetic algorithms. Proc. IEEE International Conference on Evolutionary Computation, IEEE Press, (1994) 384–389
Vose, M. D., Modeling of genetic algorithms. In Whitley L. D. (ed), Foundations of Genetic Algorithms 2, (1992) 63–73
Isaacson, D. L. and Madsen, R. W.: Markov Chains Theory and Applications. New York, USA: John Wiley and Sons. (1976)
Bellman, R. and Dreyfus, S.: Applied Dynamic Programming. Princeton, N. J.: Princeton University Press. (1962)
Feldbaum, A.: Optimal Control Systems. New York: Academic Press. (1965)
Cao, X. R. and Wan, Y: Algorithms for sensitivity analysis of Markov systems through potentials and perturbation realization. IEEE Trans. on Contr. Syst. Tech., 6, (1998) 482–494
Ho, Y. C. and Cao, X. R.: Perturbation Analysis of Discrete Event Dynamic Systems. Boston, MA: Kluwer (1991)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cao, Y., Cao, L. (1999). Controlled Markov Chain Optimization of Genetic Algorithms. In: Reusch, B. (eds) Computational Intelligence. Fuzzy Days 1999. Lecture Notes in Computer Science, vol 1625. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48774-3_22
Download citation
DOI: https://doi.org/10.1007/3-540-48774-3_22
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66050-7
Online ISBN: 978-3-540-48774-6
eBook Packages: Springer Book Archive