Saif Ahmed
ABSTRACT
Evolutionary algorithms often suffer from premature convergence when dealing with complex multi-modal function optimization problems as the fitness landscape may contain numerous local optima. To avoid premature convergence, sufficient amount of genetic diversity within the evolving population needs to be preserved. In this paper we investigate the impact of two different categories of mutation operators on evolutionary programming in an attempt to preserve genetic diversity. Participation of the mutation operators on the evolutionary process is guided by fitness stagnation and localization information of the individuals. A simple experimental analysis has been shown to demonstrate the effectiveness of the proposed scheme over a test-suite of five classical benchmark functions
- A. Della Cioppa, C. DeStefano, and A. Marcelli. Where are the niches? Dynamic fitness sharing. IEEE Trans. Evol. Comput., 11(4):453--465, August 2007. Google Scholar
Digital Library
- T. Bäck and H.-P. Schwefel. An overview of evolutionary algorithms for parameter optimization. Evolutionary Comput., 1(1):1--23, 1993. Google ScholarDigital Library
- X. Yao, Y. Liu and G. Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82--102, July 1999. Google ScholarDigital Library
- S. Das, A. Abraham, U. K. Chakraborty, and A. Konar. Differential evolution using a neighborhood-based mutation operator. IEEE Trans. Evol. Comput., 13(3):526--553, June 2009. Google ScholarDigital Library
- M. S. Alam, M. M. Islam, X. Yao, and K. Murase, "Diversity Guided Evolutionary Programming: A novel approach for continuous optimization," Appl. Soft Comput., vol. 12, no. 6, pp. 1693--1707, Jun. 2012. Google ScholarDigital Library
- K. Chellapilla, "Combining mutation operators in evolutionary programming," IEEE Trans. Evol. Comput., vol. 2, no. 3, pp. 91--96, Sep. 199 Google ScholarDigital Library
Index Terms
- An efficient evolutionary programming algorithm using mixed mutation operators for numerical optimization
Recommendations
Use of the q-Gaussian mutation in evolutionary algorithms
Special issue on advances in computational intelligence and bioinformaticsThis paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed ...
Diversity Guided Evolutionary Programming: A novel approach for continuous optimization
Avoiding premature convergence to local optima and rapid convergence towards global optima has been the major concern with evolutionary systems research. In order to avoid premature convergence, sufficient amount of genetic diversity within the evolving ...
A step size based self-adaptive mutation operator for evolutionary programming
GECCO Comp '14: Proceedings of the Companion Publication of the 2014 Annual Conference on Genetic and Evolutionary ComputationThe mutation operator is the only genetic operator in Evolutionary Programming (EP). In the past researchers have nominated Gaussian, Cauchy, and Lévy distributions as mutation operators. According to the No Free Lunch theorem [9], no single mutation ...
Comments