Abstract
This paper puts forward a brief runtime analysis of an evolutionary programming (EP) which is one of the most important continuous optimization evolutionary algorithms. A theoretical framework of runtime analysis is proposed by modeling EP as an absorbing Markov process. The framework is used to study the runtime of a classical EP algorithm named as EP with Cauchy mutation (FEP). It is proved that the runtime of FEP can be less than a polynomial of n if the Lebesgue measure of optimal solution set is more than an exponential form of 2. Moreover, the runtime analysis result can be used to explain the performance of EP based on Cauchy mutation.
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
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. Wiley, New York (1996)
Fogel, D.B.: Applying evolutionary programming to selected traveling sales-man problems. Cybernetics System 24, 27–36 (1993)
Bäck, T., Schwefel, H.P.: An overview of evolutionary algorithms for parameter optimization. Evolutionary Computation 1(1), 1–23 (1993)
Schwefel, H.P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3(2), 82–103 (1999)
Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-Adaptive Control Parame-ters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems. IEEE Transactions on Evolutionary Computation 10(6), 646–657 (2006)
Rudolph, G.: Self-Adaptation and global convergence: A Counter-Example. In: Proceedings of the Congress on Evolutionary Computation, vol. 1, pp. 646–651. IEEE Press, Piscataway (1999)
Rudolph, G.: Convergence of non-elitist strategies. In: Proceedings of the First IEEE Conference on Evolutionary Computation, vol. 1, pp. 63–66. IEEE Press, Piscataway (1994)
Rudolph, G.: Convergence of evolutionary algorithms in general search spaces. In: Proceedings of the Third IEEE Conference on Evolutionary Computation, pp. 50–54. IEEE Press, Piscateway (1996)
He, J., Yao, X.: Drift analysis and average time complexity of evolutionary algorithms. Artificial Intelligence 127(1), 57–85 (2001)
Yu, Y., Zhou, Z.H.: A new approach to estimating the expected first hitting time of evolutionary algorithms. Artificial Intelligence 172, 1809–1832 (2008)
Huang, H., Wu, C.G., Hao, Z.F.: A Pheromone-rate-based Analysis on the Convergence Time of ACO Algorithm. IEEE Transaction on System, Man and Cybernetics – Part B 39(4), 910–923 (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Huang, H., Hao, Z., Cai, Z., Zhu, Y. (2010). Runtime Analysis of Evolutionary Programming Based on Cauchy Mutation. In: Panigrahi, B.K., Das, S., Suganthan, P.N., Dash, S.S. (eds) Swarm, Evolutionary, and Memetic Computing. SEMCCO 2010. Lecture Notes in Computer Science, vol 6466. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17563-3_27
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17562-6
Online ISBN: 978-3-642-17563-3
eBook Packages: Computer ScienceComputer Science (R0)