Abstract
Evolutionary programming (EP) is a classical evolutionary algorithm for continuous optimization. There have been several EP algorithms proposed based on different mutations strategies like Gaussian, Cauchy, Levy and other stochastic distributions. However, their convergence speed should be improved. An EP based on individual random difference (EP-IRD) was proposed to attain better solutions in a higher speed. The mutation of EP-IRD uses a random difference of individuals selected randomly to update the variance with which offspring are generated. The IRD-based mutation can make the better offspring according to the current population faster than the mathematical stochastic distribution. The numerical results of solving benchmark problems indicate that EP-IRD performs better than other four EP algorithms based on mathematical stochastic distribution in the items of convergence speed, optimal value on average and standard deviation.
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
Holland, J.H.: Adaptation in Natural and Artificial Systems, 1st edn. (1975), 2nd edn. MIT press, Cambridge (1992)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. Wiley, New York (1996)
Rechenberg, I.: Evolutions strategies: Optimiering technischer Systeme nach Prinzipien der biologischen Evolution. Frommann-Holzboog, Stuttgart (1973)
Schwefel, H.P.: Numerische Optimierung von Computer-Modellen mittels der Evolutions strategies, vol. 26. Interdisciplinary Systems Research. Birkhauser, Basle (1977)
Fogel, D.B.: System Identification Through Simulated Evolution: A Machine Learning Approach to Modeling. Ginn, Needham Heights (1991)
Fogel, D.B.: Evolving artificial intelligence. Ph.D. dissertation, University of California, San Diego (1992)
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)
Lee, C.Y., Yao, X.: Evolutionary programming using mutations based on Lévy probability distribution. IEEE Transactions on Evolutionary Computation 8(5), 1–13 (2004)
Abdel-Rahman, H., Masao, F.: Directed Evolutionary Programming: Towards an Improved Performance of Evolutionary Programming, pp. 1521–1528 (2006)
Zhang, H., Lu, J.: Adaptive evolutionary programming based on reinforcement learning. Information Sciences 178, 971–984 (2008)
Zhao, X., Gao, X.S., Hu, Z.C.: Evolutionary programming based on non-uniform mutation. Applied Mathematics and Computation 192, 1–11 (2007)
Dong, H., He, J., Huang, H., Hou, W.: Evolutionary programming using a mixed mutation strategy. Information Sciences 177, 312–327 (2007)
Chen, G., Low, C.P., Yang, Z.: Preserving and Exploiting Genetic Diversity in Evolutionary Programming Algorithms. IEEE Transactions on Evolutionary Computation 13(3), 661–673 (2009)
Liang, K.H., Yao, X.: Adapting Self-Adaptive Parameters in Evolutionary Algorithms. Applied Intelligence 15, 171–180 (2001)
Brest, J., Greiner, S., Boskovic, B., Mernik, M., Zumer, V.: Self-Adaptive Control Parameters in Differential Evolution: A Comparative Study on Numerical Benchmark Problems. IEEE Transactions on Evolutionary Computation 10(6), 646–657 (2006)
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
Cai, Z., Huang, H., Hao, Z., Li, X. (2010). Evolutionary Programming Improved by an Individual Random Difference 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_41
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_41
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)