Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2010.17B.2.149

Selective Mutation for Performance Improvement of Genetic Algorithms  

Jung, Sung-Hoon (한성대학교 정보통신공학과)
Publication Information
The KIPS Transactions:PartB / v.17B, no.2, 2010 , pp. 149-156 More about this Journal
Abstract
Since the premature convergence phenomenon of genetic algorithms (GAs) degrades the performances of GAs significantly, solving this problem provides a lot of effects to the performances of GAs. In this paper, we propose a selective mutation method in order to improve the performances of GAs by alleviating this phenomenon. In the selective mutation, individuals are additionally mutated at the specific region according to their ranks. From this selective mutation, individuals with low ranks are changed a lot and those with high ranks are changed small in the phenotype. Finally, some good individuals search around them in detail and the other individuals have more chances to search new areas. This results in enhancing the performances of GAs through alleviating of the premature convergence phenomenon. We measured the performances of our method with four typical function optimization problems. It was found from experiments that our proposed method considerably improved the performances of GAs.
Keywords
Genetic Algorithms; Premature Convergence Phenomenon; Function Optimization; Selective Mutation;
Citations & Related Records
연도 인용수 순위
  • Reference
1 J. L. R. Filho and P. C. Treleaven, “Genetic-Algorithm Programming Environments,” IEEE Computer Magazine, pp.28-43, June, 1994.   DOI   ScienceOn
2 D. Beasley, D. R. Bull, and R. R. Martin, “An Overview of Genetic Algorithms: Part 1, Fundamentals,” Technical Report obtained from http://home.ifi.uio.no/~jimtoer/GA_Overview1.pdf.
3 D. B. Fogel, “An Introduction to Simulated Evolutionary Optimization,” IEEE Transactions on Neural Networks, Vol.5, pp.3-14, Jan., 1994.   DOI   ScienceOn
4 H. Szczerbicka and M. Becker, “Genetic Algorithms: A Tool for Modelling, Simulation, and Optimization of Complex Systems,” Cybernetics and Systems: An International Journal, Vol.29, pp.639-659, Aug., 1998.   DOI   ScienceOn
5 R. Yang and I. Douglas, “Simple Genetic Algorithm with Local Tuning: Efficient Global Optimizing Technique,” Journal of Optimization Theory and Applications, Vol.98, pp.449-465, Aug., 1998.   DOI   ScienceOn
6 M. Srinivas and L. M. Patnaik, “Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms,” IEEE Transactions on Systems, Man and Cybernetics, Vol.24, No.4, pp.656-667, Apr., 1994.   DOI   ScienceOn
7 A. E. Eiben, Z. Michalewicz, m. Schoenauer, and J. E. Smith “Parameter Control in Evolutionary Algorithms,” Studies in Computational Intelligence, Vol.54, pp.19-46, 2007.   DOI
8 Silja Meyer-Nieberg and Hans-Georg Beyer, “Self-Adaptation in Evolutionary Algorithms,” Studies in Computational Intelligence, Vol.54, pp.47-75, 2007.   DOI
9 C. W. Ho, K. H. Lee, and K. S. Leung, “A Genetic Algorithm Based on Mutation and Crossover with Adaptive Probabilities,” Proceedings of the 1999 Congress on Evolutionary Computation, Vol.1, pp.768-775, 1999.
10 D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning,” Addison-Wesley, 1989.
11 M. Srinivas and L. M. Patnaik, “Genetic Algorithms: A Survey,” IEEE Computer Magazine, pp.17-26, June, 1994.   DOI   ScienceOn
12 C. Xudong, Q. Jingen, N. Guangzheng, Y. Shiyou, and Z. Mingliu, “An Improved Genetic Algorithm for Global Optimization of Electromagnetic Problems,” IEEE Transactions on Magnetics, Vol.37, pp.3579-3583, Sept., 2001.   DOI   ScienceOn
13 J. A. Vasconcelos, J. A. Ramirez, R. H. C. Takahashi, and R. R. Saldanha, “Improvements in Genetic Algorithms,” IEEE Transactions on Magnetics, Vol.37, pp.3414-3417, Sept., 2001.   DOI   ScienceOn
14 Zhihua Tang, Youtuan Zhu, Guo Wei, and Jinkang Zhu, “An Elitist Selection Adaptive Genetic Algorithm for Resource Allocation in Multiuser Packet-based OFDM Systems,” Journal of Communications, Vol. 3, No. 3, pp.27-32, July 2008.
15 E. Alba and B. Dorronsoro, “The exploration/exploitation tradeoff in dynamic cellular genetic algorithms,” IEEE Transactions on Evolutionary Computation, Vol.9, pp.126-142, Apr., 2005.   DOI   ScienceOn
16 V. K. Koumousis and C. Katsaras, “A saw-tooth genetic algorithm combining the effects of variable population size and reinitialization to enhance performance,” IEEE Transactions on Evolutionary Computation, Vol.10, pp.19-28, Feb., 2006.   DOI   ScienceOn
17 J. Andre, P. Siarry, and T. Dognon, “An improvement of the standard genetic algorithm fighting premature convergence in continuous optimization,” Advances in engineering software, Vol.32, No.1, pp.49-60, 2001.   DOI   ScienceOn