Call for Paper - September 2022 Edition
IJCA solicits original research papers for the September 2022 Edition. Last date of manuscript submission is August 22, 2022. Read More

A Rank based Adaptive Mutation in Genetic Algorithm

Print
PDF
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Year of Publication: 2020
Authors:
Avijit Basak
10.5120/ijca2020920572

Avijit Basak. A Rank based Adaptive Mutation in Genetic Algorithm. International Journal of Computer Applications 175(10):49-55, August 2020. BibTeX

@article{10.5120/ijca2020920572,
	author = {Avijit Basak},
	title = {A Rank based Adaptive Mutation in Genetic Algorithm},
	journal = {International Journal of Computer Applications},
	issue_date = {August 2020},
	volume = {175},
	number = {10},
	month = {Aug},
	year = {2020},
	issn = {0975-8887},
	pages = {49-55},
	numpages = {7},
	url = {http://www.ijcaonline.org/archives/volume175/number10/31493-2020920572},
	doi = {10.5120/ijca2020920572},
	publisher = {Foundation of Computer Science (FCS), NY, USA},
	address = {New York, USA}
}

Abstract

Traditionally Genetic Algorithm has been used for optimization of unimodal and multimodal functions. Earlier researchers worked with constant probabilities of GA control operators like crossover, mutation etc. for tuning the optimization in specific domains. Recent advancements in this field witnessed adaptive approach in probability determination. In Adaptive mutation primarily poor individuals are utilized to explore state space, so mutation probability is usually generated proportionally to the difference between fitness of best chromosome and itself (fMAX - f). However, this approach is susceptible to nature of fitness distribution during optimization.

This paper presents an alternate approach of mutation probability generation using chromosome rank to avoid any susceptibility to fitness distribution. Experiments are done to compare results of simple genetic algorithm (SGA) with constant mutation probability and adaptive approaches within a limited resource constraint for unimodal, multimodal functions and Travelling Salesman Problem (TSP). Measurements are done for average best fitness, number of generations evolved and percentage of global optimum achievements out of several trials. The results demonstrate that the rank-based adaptive mutation approach is superior to fitness-based adaptive approach as well as SGA in a multimodal problem space.

References

  1. Srinivas, M. and Patnaik, L. M., Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms, IEEE Transactions on Systems, Man and Cybernetics, VOL. 24, NO. 4, APRIL 1994.
  2. DeJong, K. A., An analysis of the behaviour of a class of genetic adaptive systems Ph.D. dissertation, University of Michigan (1975)
  3. Goldberg, D. E., Genetic Algorithms in Search, Optimization and Machine Learning, Addition-Wesley Publishing Co., Inc. Boston, MA, USA. (1989)
  4. Mille, Brad L., Goldberg, D. E., Genetic Algorithms, Tournament Selection, and the Effects of Noise, Complex Systems 9 (1995) 193- 212
  5. Goldberg, D.E., Deb, K., A Comparative Analysis of Selection Schemes Used in Genetic Algorithms, University of Illinois at Urbana-Champaign, Urbana, United States
  6. Kühn, M., Severin, T., Salzwedel H., Variable Mutation Rate at Genetic Algorithms: Introduction of Chromosome Fitness in Connection with Multi-Chromosome Representation, International Journal of Computer Applications (0975 – 8887), Volume 72– No.17, June 2013
  7. Khemani, Deepak, A First Course in Artificial Intelligence, McGraw Hill Education (India) Private Limited, Chennai, India
  8. Korejo++, I.A., Khuhro, Z.U.A., Jokhio, F. A., Channa*, N., Nizamani, H. A., An Adaptive Crossover Operator for Genetic Algorithms to Solve the Optimization Problems, Sindh University Research Journal (Science Series) Vol.45 (2) 333-340 (2013) Ding, W. and Marchionini, G. 1997 A Study on Video Browsing Strategies. Technical Report. University of Maryland at College Park.

Keywords

Genetic Algorithm, Adaptive mutation.