Browse > Article
http://dx.doi.org/10.5391/IJFIS.2010.10.2.146

Rank-based Control of Mutation Probability for Genetic Algorithms  

Jung, Sung-Hoon (Department of Information and Communication Engineering, Hansung University)
Publication Information
International Journal of Fuzzy Logic and Intelligent Systems / v.10, no.2, 2010 , pp. 146-151 More about this Journal
Abstract
This paper proposes a rank-based control method of mutation probability for improving the performances of genetic algorithms (GAs). In order to improve the performances of GAs, GAs should not fall into premature convergence phenomena and should also be able to easily get out of the phenomena when GAs fall into the phenomena without destroying good individuals. For this, it is important to keep diversity of individuals and to keep good individuals. If a method for keeping diversity, however, is not elaborately devised, then good individuals are also destroyed. We should devise a method that keeps diversity of individuals and also keeps good individuals at the same time. To achieve these two objectives, we introduce a rank-based control method of mutation probability in this paper. We set high mutation probabilities to lowly ranked individuals not to fall into premature convergence phenomena by keeping diversity and low mutation probabilities to highly ranked individuals not to destroy good individuals. We experimented our method with typical four function optimization problems in order to measure the performances of our method. It was found from extensive experiments that the proposed rank-based control method could accelerate the GAs considerably.
Keywords
Genetic algorithms; premature convergence phenomena; function optimization; rank-based control;
Citations & Related Records
연도 인용수 순위
  • Reference
1 C. W. Ho, K. H. Lee, and K. S. Leung, “A Genetic Algorithm Based on Mutation and Crossover with Adaptive Probabilities,” in Proceedings of the 1999 Congress on Evolutionary Computation, vol. 1, pp. 768-775, 1999.
2 J. E. Smith and T. C. Fogarty, “Operator and parameter adaptation in genetic algorithms,” Soft computing : a fusion of foundations, methodologies and applications, vol. 92, no. 2, pp. 81-87, 1997.
3 A. Tuson and P. Ross, “Adapting Operator Settings In Genetic Algorithms,” Evolutionary Computation, vol. 6, no. 2, pp. 161-184, 1998.   DOI   ScienceOn
4 S. Meyer-Nieberg and H.-G. Beyer, “Self-Adaptation in Evolutionary Algorithms,” Studies in Computational Intelligence, vol. 54, pp. 47-75, 2007.   DOI
5 Z. Tang, Y. Zhu, G. Wei, and J. Zhu, “An Elitist Selection Adaptive Genetic Algorithm for Resource Allocation in Multiuser Packet-based OFDM Systems,” Journal of Communications, vol. 3, pp. 27-32, July 2008.
6 S. M. Libelli and P. Alba, “Adaptive mutation in genetic algorithms,” Soft Computing, vol. 4, pp. 76-80, 2000.   DOI
7 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
8 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
9 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
10 Z. Jinhua, Z. Jian, D. Haifeng, and W. Sun’an, “Self-organizing genetic algorithm based tuning of PID controllers,” Information Sciences, vol. 179, pp. 1007-1018, 2009.   DOI   ScienceOn
11 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
12 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
13 L. Davis, “Adapting Operator Probabilities in Genetic Algorithms,” in Proceedings of the 3rd International Conference on Genetic Algorithms and their Applications, pp. 61-69, 1989.
14 M. Srinivas and L. M. Patnaik, “Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms,” IEEE Transactions on Systems, Man and Cybernetics, vol. 24, pp. 656-667, Apr. 1994.   DOI   ScienceOn
15 A. Tuson, “Adapting Operator Probabilities in Genetic Algorithms,” master thesis, Dept. of Artificial Intelligence, University of Edinburgh, UK, 1995.
16 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.
17 D. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Reading, MA: Addison-Wesley, 1989.
18 M. Srinivas and L. M. Patnaik, “Genetic Algorithms: A Survey,” IEEE Computer Magazine, pp. 17-26, June 1994.   DOI   ScienceOn
19 J. L. R. Filho and P. C. Treleaven, “Genetic-Algorithm Programming Environments,” IEEE Computer Magazine, pp. 28-43, June 1994.   DOI   ScienceOn
20 D. B. Fogel, “An Introduction to Simulated Evolutionary Optimization,” IEEE Transactions on Neural Networks, vol. 5, pp. 3-14, Jan. 1994.   DOI   ScienceOn
21 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