Abstract
Developing directed mutation methods has been an interesting research topic to improve the performance of genetic algorithms (GAs) for function optimization. This paper introduces a directed mutation (DM) operator for GAs to explore promising areas in the search space. In this DM method, the statistics information regarding the fitness and distribution of individuals over intervals of each dimension is calculated according to the current population and is used to guide the mutation of an individual toward the neighboring interval that has the best statistics result in each dimension. Experiments are carried out to compare the proposed DM technique with an existing directed variation on a set of benchmark test problems. The experimental results show that the proposed DM operator achieves a better performance than the directed variation on most test problems.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Back, T.: Evolutionary Algorithms in Theory and Practice. Oxford University Press, Oxford (1996)
Berlik, S.: A directed mutation framework for evolutionary algorithms. In: Proc. of the Int. Conf. on Soft Computing, MENDEL, pp. 45–50 (2004)
Berry, A., Vamplew, P.: PoD Can Mutate: A simple dynamic directed mutation approach for genetic algorithms. In: Proc. of AISAT 2004: Int. Conf. on Artificial Intelligence in Science and Technology, pp. 200–205 (2004)
Eiben, A.E., Michalewics, Z., Schoenauer, M., Smith, J.E.: Parameter control in evolutionary algorithms. In: Lobo, F.G., Lima, C.F., Michalewicz, Z. (eds.) Parameter Setting in Evolutionary Algorithms, ch. 2, pp. 19–46 (2007)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization, and Machine Learning. Addison Wesley, New York (1989)
Hedar, A.R., Fukushima, M.: Directed evolutionary programming: Towards an improved performance of evolutionary programming. In: Proc. of the 2006 IEEE Congress on Evol. Comput., pp. 1521–1528 (2006)
Salomon, R.: Reevaluating genetic algorithm performance under coordinate rotation of benchmark functions: A survey of some theoretical and practical aspects of genetic algorithms. BioSystems 39(3), 263–278 (1996)
Schwefel, H.-P.: Evolution and Optimum Seeking. Wiley, New York (1995)
Spears, W.M.: Crossover or mutation? In: Whitley, L.D. (ed.) Foundations of Genetic Algorithms 2, pp. 81–89. Morgan Kaufmann Publishers, San Mateo (1993)
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 (2005)
Temby, L., Vamplew, P., Berry, A.: Accelerating real valued genetic algorithms using mutation-with-momentum. In: Zhang, S., Jarvis, R.A. (eds.) AI 2005. LNCS (LNAI), vol. 3809, pp. 1108–1111. Springer, Heidelberg (2005)
Yao, X., Liu, Y., Lin, G.: Evolutionary programming made faster. IEEE Trans. on Evol. Comput. 3(2), 82–102 (1999)
Zhou, Q., Li, Y.: Directed variation in evolutionary strategies. IEEE Trans. on Evol. Comput. 7(4), 356–366 (2003)
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
Korejo, I., Yang, S., Li, C. (2010). A Directed Mutation Operator for Real Coded Genetic Algorithms. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12239-2_51
Download citation
DOI: https://doi.org/10.1007/978-3-642-12239-2_51
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12238-5
Online ISBN: 978-3-642-12239-2
eBook Packages: Computer ScienceComputer Science (R0)