Abstract
Although initially conceived for evolving finite state machines, Evolutionary Programming (EP), in its present form, is largely used as a powerful real parameter optimizer. For function optimization, EP mainly relies on its mutation operators. Over past few years several mutation operators have been proposed to improve the performance of EP on a wide variety of numerical benchmarks. However, unlike real-coded GAs, there has been no fitness-induced bias in parent selection for mutation in EP. That means the i-th population member is selected deterministically for mutation and creation of the i-th offspring in each generation. In this article we present an improved EP variant called Evolutionary Programming with Voting and Elitist Dispersal (EPVE). The scheme encompasses a voting process which not only gives importance to best solutions but also consider those solutions which are converging fast. By introducing Elitist Dispersal Scheme we maintain the elitism by keeping the potential solutions intact and other solutions are perturbed accordingly, so that those come out of the local minima. By applying these two techniques we can be able to explore those regions which have not been explored so far that may contain optima. Comparison with the recent and best-known versions of EP over 25 benchmark functions from the CEC (Congress on Evolutionary Computation) 2005 test-suite for real parameter optimization reflects the superiority of the new scheme in terms of final accuracy, speed, and robustness.
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.: Autonomous automata. Industrial Research 4, 14–19 (1962)
Fogel, L.J.: On the Organization of Intellect, Ph. D. thesis. University of California, Los Angeles (1964)
Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence through Simulated Evolution. John Wiley, New York (1966)
Yao, X., Liu, Y., Liu, G.: Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation 3(2), 82–102 (1999)
Lee, C.Y., Yao, X.: Evolutionary programming using mutations based on the Lévy probability distribution. IEEE Transactions on Evolutionary Computation 8(1), 1–13 (2004)
Mallipeddi, R., Mallipeddi, S., Suganthan, P.N.: Ensemble strategies with adaptive evolutionary programming. Information Sciences 180(9), 1571–1581
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)
Zhan, Z.-H., Zhang, J., Li, Y., Chung, H.S.-H.: Adaptive Particle Swarm Optimization, Systems, Man, and Cybernetics. IEEE Transactions on Part B: Cybernetics 39(6), 1362–1381 (2009)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.-P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization, Technical Report, Nanyang Technological University, Singapore, KanGAL Report #2005005, IIT Kanpur, India (May 2005)
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
Maity, S., Gunjan, K., Das, S. (2010). An Improved Evolutionary Programming with Voting and Elitist Dispersal Scheme. 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_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-17563-3_25
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)