Abstract
Genetic Algorithm (GA) is a robust and popular stochastic optimization algorithm for large and complex search spaces. The major disadvantages of Genetic Algorithms are premature convergence and revisits to individual solutions in the search space. In other words, Genetic algorithm is a revisiting algorithm that leads to duplicate function evaluations which is a clear waste of time and computational resources. In this paper, a non-revisiting genetic algorithm with adaptive mutation is proposed for the domain of function optimization. In this algorithm whenever a revisit occurs, the underlined search point is replaced with a mutated version of the best/random (chosen probabilistically) individual from the GA population. Moreover, the suggested approach is not using any extra memory resources to avoid revisits. To test the power of the method, the proposed non-revisiting algorithm is evaluated using nine benchmarks functions. The performance of the proposed genetic algorithm is superior as compared to simple genetic algorithm as confirmed by the experimental results.
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
Holland, J.H.: Adaptation in Natural and Artificial Systems. MI Univ. Michigan Press, Ann Arbor (1975)
Goldberg, D.E.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley, New York (1989)
Michalewicz, Z.: Genetic Algorithms + Data Structures = Evolution Programs. Springer, Heidelberg (1999)
Davis, L.: Handbook of Genetic Algorithms. Van Nostrand Reinhold, New York (1991)
De Jong, K.A.: An Analysis of the Behavior of a Class of Genetic Adaptive Systems, PhD Thesis, University of Michigan, Ann Arbor, MI, USA (1975)
Srinivasa, K.G., Venugopal, K.R., Patnaik, L.M.: A Self Adaptive Migration Model Genetic Algorithm for Data Mining Applications. Information Sciences 177, 4295–4313 (2007)
Ono, I., Kita, H., Kobayashi, S.: A Robust Real-Coded Genetic Algorithm using Unimodal Normal Distribution Crossover Augmented by Uniform Crossover: Effects of Self-Adaptation of Crossover Probabilities. In: Proceedings of the Genetic and Evolutionary Computation Conference, vol. 1, pp. 496–503. Morgan Kaufmann, Orlando (1999)
Srinivas, M., Patnaik, L.M.: Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms. IEEE Transactions on Systems, Man and Cybernetics 24, 656–667 (1994)
Herrera, F., Lozano, M.: Gradual Distributed Real-Coded Genetic Algorithms. IEEE Transactions on Evolutionary Computation 4, 43–63 (2000)
Mauldin, M.L.: Maintaining Diversity in Genetic Search. In: Proceeding National Conference on Artificial Intelligence, Austin, pp. 247–250 (1984)
Eshelman, L., Schaffer, J.: Preventing Premature Convergence in Genetic Algorithms by Preventing Incest. In: Proceedings of the Fourth International Conference on Genetic Algorithms. Morgan Kaufmann, San Mateo (1991)
Povinelli, R.J., Feng, X.: Improving Genetic Algorithms Performance by Hashing Fitness Values. In: Proceedings Artificial Neural Network, England, pp. 399–404 (1999)
Kratica, J.: Improving the Performances of Genetic Algorithm by Caching. Computer Artificial Intelligence 18, 271–283 (1999)
Friedrich, T., Hebbinghaus, N., Neumann, F.: Rigorous Analysis of Simple Diversity Mechanisms. In: Proc. Genetic Evolutionary Computation Conference, pp. 1219–1225. ACM Press, London (2007)
Ronald, S.: Duplicate Genotypes in a Genetic Algorithm. In: Proc. IEEE Int. Conf. Evolutionary Computation, Anchorage, Alaska, pp. 793–798 (1998)
Yuen, S.Y., Chow, C.K.: A Non-revisiting Genetic Algorithm. In: Proc. IEEE Congress on Evolutionary Computation, Singapore, pp. 4583–4590 (2007)
Saroj, Kapila, Kumar, D., Kanika: A Genetic Algorithm with Entropy Based Probabilistic Initialization and Memory for Automated Rule Mining. In: Meghanathan, N., Kaushik, B.K., Nagamalai, D. (eds.) CCSIT 2011, Part I. CCIS, vol. 131, pp. 604–613. Springer, Heidelberg (2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Saroj, Devraj (2012). A Non-revisiting Genetic Algorithm with Adaptive Mutation for Function Optimization. In: Meghanathan, N., Chaki, N., Nagamalai, D. (eds) Advances in Computer Science and Information Technology. Computer Science and Engineering. CCSIT 2012. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 85. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-27308-7_31
Download citation
DOI: https://doi.org/10.1007/978-3-642-27308-7_31
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-27307-0
Online ISBN: 978-3-642-27308-7
eBook Packages: Computer ScienceComputer Science (R0)