{"references": ["D. Goldberg, Genetic Algorithms in Search, Optimization and Machine\nLearning. Reading, MA: Addison-Wesley, 1989.", "M. Srinivas and L. M. Patnaik, \"Genetic Algorithms: A Survey,\" IEEE\nComputer Magazine, pp. 17-26, June 1994.", "J. L. R. Filho and P. C. Treleaven, \"Genetic-Algorithm Programming\nEnvironments,\" IEEE Computer Magazine, pp. 28-43, June 1994.", "D. Beasley, D. R. Bull, and R. R. Martin, \"An Overview of Genetic\nAlgorithms: Part 1, Fundamentals,\" Technical Report obtained from\nhttp://home.ifi.uio.no/\u252c\u00ea jimtoer/GA Overview1.pdf.", "D. B. Fogel, \"An Introduction to Simulated Evolutionary Optimization,\"\nIEEE Transactions on Neural Networks, vol. 5, pp. 3-14, Jan. 1994.", "H. Szczerbicka and M. Becker, \"Genetic Algorithms: A Tool for Modelling,\nSimulation, and Optimization of Complex Systems,\" Cybernetics\nand Systems: An International Journal, vol. 29, pp. 639-659, Aug. 1998.", "R. Yang and I. Douglas, \"Simple Genetic Algorithm with Local Tuning:\nEfficient Global Optimizing Technique,\" Journal of Optimization Theory\nand Applications, vol. 98, pp. 449-465, Aug. 1998.", "C. Xudong, Q. Jingen, N. Guangzheng, Y. Shiyou, and Z. Mingliu, \"An\nImproved Genetic Algorithm for Global Optimization of Electromagnetic\nProblems,\" IEEE Transactions on Magnetics, vol. 37, pp. 3579-\n3583, Sept. 2001.", "J. A. Vasconcelos, J. A. Ramirez, R. H. C. Takahashi, and R. R.\nSaldanha, \"Improvements in Genetic Algorithms,\" IEEE Transactions\non Magnetics, vol. 37, pp. 3414-3417, Sept. 2001.\n[10] E. Alba and B. Dorronsoro, \"The exploration/exploitation tradeoff in dynamic\ncellular genetic algorithms,\" IEEE Transactions on Evolutionary\nComputation, vol. 9, pp. 126-142, Apr. 2005.\n[11] V. K. Koumousis and C. Katsaras, \"A saw-tooth genetic algorithm\ncombining the effects of variable population size and reinitialization\nto enhance performance,\" IEEE Transactions on Evolutionary Computation,\nvol. 10, pp. 19-28, Feb. 2006.\n[12] J. Andre, P. Siarry, and T. Dognon, \"An improvement of the standard\ngenetic algorithm fighting premature convergence in continuous optimization,\"\nAdvances in engineering software, vol. 32, no. 1, pp. 49-60,\n2001.\n[13] J. E. Smith and T. C. Fogarty, \"Operator and parameter adaptation in\ngenetic algorithms,\" Soft computing : a fusion of foundations, methodologies\nand applications, vol. 92, no. 2, pp. 81-87, 1997.\n[14] C. W. Ho, K. H. Lee, and K. S. Leung, \"A Genetic Algorithm Based on\nMutation and Crossover with Adaptive Probabilities,\" in Proceedings of\nthe 1999 Congress on Evolutionary Computation, vol. 1, pp. 768-775,\n1999.\n[15] S. H. Jung, \"Queen-bee evolution for genetic algorithms,\" Electronics\nLetters, vol. 39, pp. 575-576, Mar. 2003.\n[16] K. DeJong, An Analysis of the Behavior of a Class of Genetic Adaptive\nSystems. PhD thesis, University of Michigan, 1975."]}

In this paper, we propose a selective mutation method for improving the performances of genetic algorithms. In selective mutation, individuals are first ranked and then additionally mutated one bit in a part of their strings which is selected corresponding to their ranks. This selective mutation helps genetic algorithms to fast approach the global optimum and to quickly escape local optima. This results in increasing the performances of genetic algorithms. We measured the effects of selective mutation with four function optimization problems. It was found from extensive experiments that the selective mutation can significantly enhance the performances of genetic algorithms.