On the convergence rate of the elitist genetic algorithm based on mutation probability

References

• Andrade, B. B., and A. G. C. Pereira. 2015. On the genetic algorithm with adaptive mutation rate and selected statistical applications. Computational Statistics 30(1):131–50.
   Web of Science ®Google Scholar
• Campos, V. S. M., A. G. C. Pereira, and J. A. R. Cruz. 2012. Modeling the genetic algorithm by a non-homogeneous Markov chain: Weak and strong ergodicity. Theory of Probability and Its Applications 57 (1):185–92.
   Web of Science ®Google Scholar
• Campos, V. S. M., A. G. C. Pereira, L. A. Carlos, and I. A. S. Assis. 2012. Algoritmo genético por cadena de markov homogénea versus no-homogénea: Un estudio comparativo. Journal of the Chilean Institute of Operations Research 2:30–5.
   Google Scholar
• Ferreira, M. A. R. 2015. Inhomogeneous evolutionary MCMC for bayesian optimal sequential environmental monitoring. Environmental and Ecological Statistics 22(4):705–24.
   Web of Science ®Google Scholar
• Ferreira, M. A. R., and N. Sanyal. 2014. Bayesian optimal sequential design for nonparametric regression via inhomogeneous evolutionary MCMC. Statistical Methodology 18 :131–41.
   Google Scholar
• Ghashochi Bargh, H., and M. H. Sadr. 2011. Optimal design by Elitist-Genetic algorithm for maximum fundamental frequency of fiber metal laminated plates. Key Engineering Materials 471–472 :331–6. Vol
   Google Scholar
• Goldeberg, D. E. 1989. Genetic algorithms in search, optimizations and machine learning. Teading, MA: Addison Wesley.
   Google Scholar
• He, J., and L. Kang. 1999. On the convergence rates of genetic algorithms, theorical. Computer Science 229(1–2):23–39.
   Google Scholar
• Holland, J. H. 1975. Adaptation in natural and artificial systems. Ann Arbor: The University of Michigan Press.
   Google Scholar
• Ipsen, I. C. F., and T. M. Selee. 2011. Ergodicity coefficients defined by vector norms. SIAM Journal on Matrix Analysis and Applications 32(1):153–200.
   Web of Science ®Google Scholar
• Lund, R. B., and R. L. Tweedie. 1996. Geometric convergence rates for stochastically ordered Markov chain. Mathematics of Operations Research 21(1):182–94.
   Web of Science ®Google Scholar
• Mengersen, K. L., and R. L. Tweedie. 1996. Rates of convergence of the hastings and metropolis algorithms. The Annals of Statistics 24(1):101–21.
   Web of Science ®Google Scholar
• Meyn, S. P., and R. L. Tweedie. 1993. Markov chain and stochastic stability. London: Springer-Verlag.
   Google Scholar
• Ming, L., Y. Wang, and Y. M. Cheung. On the convergence rate of a class of genetic algorithms. World Automation Congress Proceedings, 2006: 881–886.
   Google Scholar
• Roberts, G. O., and J. S. Rosenthal. 1996. Quantitative bounds for convergence rates of continuous time Markov processes. Electronic Journal of Probability 1 :21–54.
   Google Scholar
• Rosenthal, J. S. 1995. Minorization conditions and convergence rates for Markov chain Monte Carlo. Journal of the American Statistical Association 90(430):558–66.
   Web of Science ®Google Scholar
• Rudolph, G. 1994. Convergence analysis of canonical genetic algorithms. IEEE Transactions on Neural Networks 5(1):96–101.
   PubMed Web of Science ®Google Scholar
• Sadr, M. H., and H. Ghashochi Bargh. 2011. Fundamental frequency optimization of laminated cylindrical panels by Elitist-Genetic algorithm. Key Engineering Materials 471-472 :337–42. Vol
   Google Scholar
• Sadr, M. H., and H. Ghashochi Bargh. 2012. Optimization of laminated composite plates for maximum fundamental frequency using Elitist-Genetic algorithm and finite strip method. Journal of Global Optimization 54(4):707–28.
   Web of Science ®Google Scholar
• Souza, P. S. 2014. The Canonical Genetic Algortihm and Elitist Genetic Algorithm: A comparative approach (in Portuguese). Master dissertation presented at Universidade Federal do Rio Grande do Norte. https://repositorio.ufrn.br/jspui/bitstream/123456789/17015/1/PauloSS_DISSERT.pdf
   Google Scholar
• Schmitt, F., and F. Rothlauf. 2001. On the importance of the second largest eigenvalue on the convergence rate of genetic algorithm. Proceedings of the genetic and evolutionary computation conference. Morgan Kaufmann, 559–564.
   Google Scholar
• Seneta, E. 2006. Non-Negative matrices and Markov chains. New York: Springer-Verlag, (revised reprint of 1981 edition).
   Google Scholar
• Suzuki, J. 1995. A Markov chain analysis on simple genetic algorithms. IEEE Transactions on Systems, Man, and Cybernetics 25(4):655–9.
   Web of Science ®Google Scholar
• Suzuki, J. 1998. A further result on the Markov chain model of genetic algorithms and its application to a simulated annealing-like strategy. IEEE Transactions on Systems, Man, and Cybernetics. Part B, Cybernetics : A Publication of the IEEE Systems, Man, and Cybernetics Society 28(1):95–102.
   PubMed Web of Science ®Google Scholar