Mathematical analysis of schema survival for genetic algorithms having dual mutation
- 209 Downloads
Genetic algorithms are widely used in the field of optimization. Schema theory forms the foundational basis for the success of genetic algorithms. Traditional genetic algorithms involve only a single mutation phase per iteration of the algorithm. In this paper, a novel concept of genetic algorithms involving two mutation steps per iteration is proposed. The purpose of adding a second mutation phase is to improve the explorative power of the genetic algorithms. All the possible cases regarding the working of the proposed variant of the genetic algorithms are explored. After a meticulous analysis of all these cases, three lemmas are proposed regarding the survival of a schema after the application of the dual mutation. Based on these three lemmas, a theorem is proved, and a mathematical expression representing the probability of survival of a schema after the application of the crossover and dual mutation is derived. This expression provides a new insight about the penetration of a schema for such scenario and improves our understanding of the functioning of this modified form of the genetic algorithm.
KeywordsGenetic algorithms Crossover Dual mutation Schema Schema survival
The authors are grateful to Prof. S.G. Deshmukh, Director, ABV-Indian Institute of Information Technology and Management (an autonomous institute of Government of India), Gwalior (M.P), for providing a cordial atmosphere of research in the institute.
Compliance with ethical standards
Conflict of interest
Prof. Anupam Shukla has received the funds from the Department of Electronics and Information Technology, Ministry of Communication and Information Technology, Government of India, under Grant No. 23011/22/2013-R&D in CC & BT.
- Hsu C, Cho H (2015) A genetic algorithm for the maximum edge-disjoint paths problem. Neurocomputing. doi: 10.1016/j.neucom.2012.10.046
- Pawar R, Saini JS, Gopal M, Mittal AP (2011) Towards generalized expression for schemata count. Appl Soft Comput J. doi: 10.1016/j.asoc.2010.07.012
- Shukla A, Tiwari R, Kala R (2010) Towards hybrid and adaptive computing studies in computational intelligence. Computational intelligence. Springer, Berlin. ISBN: 9783642143434. doi: 10.1007/978-3-642-14344-1
- Uzor CJ, Gongora M, Coupland S, Passow BN (2016) Adaptive-mutation compact genetic algorithm for dynamic environments. Soft Comput. doi: 10.1007/s00500-016-2195-x
- White D (2014) An overview of schema theory. Neural Evol Comput (cs.NE) 1–27. arXiv:1401.2651