We proposed a self-adaptive mutation algorithm which is varying mutation probability with evolutionary generation. Then, certify the convergence of this algorithm with the matrix theory and Markov chain and obtain the idea that this adaptive algorithm converges to the optimum with the probability. © 2012 Springer-Verlag GmbH.
CITATION STYLE
Huang, L., & Du, W. (2012). Research on convergence of self-adaptive mutation algorithm. In Lecture Notes in Electrical Engineering (Vol. 124 LNEE, pp. 583–588). https://doi.org/10.1007/978-3-642-25781-0_85
Mendeley helps you to discover research relevant for your work.