{"references": ["D. Whitley, \"A genetic algorithm tutorial,\" Statistics and Computing,\nvol. 4, pp. 65-85, 1994.", "T. B\u252c\u00bfack, U. Hammel, and H.-P. Schwefel, \"Evolutionary computation:\nComments on the history and current state,\" IEEE Transactions on\nEvolutionary Computation, vol. 1, no. 1, pp. 3-17, April 1997.", "X. Yao, \"Evolutionary computation,\" in Evolutionary Optimization,\nR. Sarker, M. Mohammadian, and X. Yao, Eds. Kluwer Academic\nPublishers, 2002, ch. 2, pp. 27-53.", "T. B\u252c\u00bfack, \"Optimal mutation rates in genetic search,\" in Proceedings of\nthe 5th International Conference on Genetic Algorithms, S. Forrest, Ed.\nSan Mateo, CA, USA: Morgan Kaufmann, 1993, pp. 2-8.", "T. B\u252c\u00bfack and M. Sch\u252c\u00bfutz, \"Intelligent mutation rate control in canonical\ngenetic algorithms,\" in Proceedings of the Ninth International Symposium\non Foundations of Intelligent Systems, ser. LNAI, Z. W. R'as and\nM. Michalewicz, Eds., vol. 1079. Berlin: Springer, June 1996, pp.\n158-167.", "G. Ochoa, I. Harvey, and H. Buxton, \"On recombination and optimal\nmutation rates,\" in Proceedings of the Genetic and Evolutionary Computation\nConference, W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon,\nV. Honavar, M. Jakiela, and R. E. Smith, Eds., vol. 1. Orlando, FL:\nMorgan Kaufmann, 1999, pp. 488-495.", "F. Zhang, Y. F. Zhang, and A. Y. C. Nee, \"Using genetic algorithms\nin process planning for job shop machining,\" IEEE Transactions on\nEvolutionary Computation, vol. 1, no. 4, pp. 278-289, November 1997.", "E. Lutton and J. L. V'ehel, \"H\u252c\u00bfolder functions and deception of genetic\nalgorithms,\" IEEE Transactions on Evolutionary Computation, vol. 2,\nno. 2, pp. 56-71, July 1998.", "A. E. Eiben, R. Hinterding, and Z. Michalewicz, \"Parameter control in\nevolutionary algorithms,\" IEEE Transactions on Evolutionary Computation,\nvol. 3, no. 2, pp. 124 - 141, July 1999.\n[10] P. J. Angeline, \"Adaptive and self-adaptive evolutionary computations,\"\nin Computational Intelligence: A Dynamic Systems Perspective,\nM. Palaniswami and Y. Attikiouzel, Eds. IEEE Press, 1995, pp. 152-\n163.\n[11] T. B\u252c\u00bfack, \"The interaction of mutation rate, selection, and self-adaption\nwithin a genetic algorithm,\" in Parallel Problem Solving from Nature,\n2: Proceedings of the Second Conference on Parallel Problem Solving\nfrom nature. Brussels: North-Holland, 1992, pp. 85-94.\n[12] D. Thierens, \"Adaptive mutation rate control schemes in genetic algorithms,\"\nin Proceedings of the 2002 Congress on Evolutionary Computation\nCEC -02, vol. 1. Honolulu, HI: IEEE, 2002, pp. 980-985.\n[13] A. Tuson and P. Ross, \"Adapting operator settings in genetic algorithms,\"\nEvolutionary Computation, vol. 6, no. 2, pp. 161-184, 1998.\n[14] H. E. Aguirre and K. Tanaka, \"Genetic algorithms on nk-landscapes:\nEffects of selection, drift, mutation, and recombination,\" Lecture Notes\nin Computer Science, vol. 2611, pp. 131-142, January 2003.\n[15] S. Uyar, S. Sariel, and G. Eryigit, \"A gene based adaptive mutation\nstrategy for genetic algorithms,\" Lecture Notes in Computer Science,\nvol. 3103, pp. 271-281, January 2004.\n[16] A. Acan, \"Mutation multiplicity in a panmictic two-strategy genetic\nalgorithm,\" Lecture Notes in Computer Science, vol. 3004, pp. 1-10,\nJanuary 2004.\n[17] A. B. Djurisic, A. D. Rakic, E. H. Li, M. L. Majewski, N. Bundaleski,\nand B. V. Stanic, \"Continuous optimization using elite genetic algorithms\nwith adaptive mutations,\" Lecture Notes in Computer Science, vol. 1585,\npp. 365-372, January 1999.\n[18] Q. Zhang, J. Sun, and E. Tsang, \"An evolutionary algorithm with guided\nmutation for the maximum clique problem,\" IEEE Transactions on\nEvolutionary Computation, vol. 9, no. 2, pp. 192 - 200, April 2005.\n[19] Z. Michalewicz and M. Schmidt, \"Evolutionary algorithms and constrained\noptimization,\" in Evolutionary Optimization, R. Sarker, M. Mohammadian,\nand X. Yao, Eds. Kluwer Academic Publishers, 2002,\nch. 3, pp. 57-86."]}

A novel method of individual level adaptive mutation rate control called the rank-scaled mutation rate for genetic algorithms is introduced. The rank-scaled mutation rate controlled genetic algorithm varies the mutation parameters based on the rank of each individual within the population. Thereby the distribution of the fitness of the papulation is taken into consideration in forming the new mutation rates. The best fit mutate at the lowest rate and the least fit mutate at the highest rate. The complexity of the algorithm is of the order of an individual adaptation scheme and is lower than that of a self-adaptation scheme. The proposed algorithm is tested on two common problems, namely, numerical optimization of a function and the traveling salesman problem. The results show that the proposed algorithm outperforms both the fixed and deterministic mutation rate schemes. It is best suited for problems with several local optimum solutions without a high demand for excessive mutation rates.