Open Access Open Access  Restricted Access Subscription or Fee Access

Analyzing the Effect of Sigma Scaling in Genetic Algorithms

Chander Diwaker, Upender Dhull, Geeta Jangra

Abstract


The Genetic Algorithms (GA) paradigm is being used increasingly in search and optimization problems. A genetic algorithm is an algorithm which varies a set of parameters and evaluates the quality or "fitness" of the results of a computation as the parameters are changed or "evolved". A study of the effect of Sigma scaling on the performance of Genetic Algorithm (GA) is reported here. This paper shows how the Sigma Scaling affects the performance of Genetic Algorithm by calculating the average and maximum fitness values. It is beneficial to use sigma scaling with genetic algorithms for three reasons. It prevents the Genetic Algorithm from premature convergence, maintains diversity in the population and always improves the performance of GA. Premature convergence is one of the major problems usually associated with the use of GA. This problem is tightly related with the loss of genetic diversity of the GA's population, being the cause of a decrease on the quality of the solutions found.

Keywords


Crossover, Fitness function, Genetic Algorithm, Mutation, Sigma Scaling, Selection.

Full Text:

PDF

References


S.N.Sivanandam, S.N.Deepa, “Introduction to Genetic Algorithms”, Springer-Verlag Berlin Heidelberg 2008.

Colin R.Reeves, “Genetic Algorithms: Principles and perspectives”,2003.

Dr. Franz Rathlauf, “Representations for Genetic and Evolutionary Algorithms”, 2nd edition, @ Springer. 2006.

Tang, K.S., K.F. Man, S. Kwong and Q. He. "Genetic algorithms and their applications" IEEE Signal Processing Magazine, vol.13, 2004.

Mitchell, Melanie,, “An Introduction to Genetic Algorithms”, MIT Press, Cambridge, MA, 1996.

L.M.Schmitt, “Fundamental Study Theory of Genetic Algorithms” , International Journal of Modelling and Simulation Theoretical Computer Science, 2001.

Forrest, Stephanie, "Genetic algorithms: principles of natural selection applied to computation." Science, vol.261, Aug. 13, 1993, pp. 872-878.

Michalewicz Z., “Genetic Algorithms + Data Structures = Evolution Programs” (3ed), Springer-Verlag, 1996.

Whitley, “A genetic algorithm tutorial. Statistics and Computing”, 1994.

Vose, Michael D, “The Simple Genetic Algorithm: Foundations and Theory”, MIT Press, Cambridge, MA, 1999.

John J. Grefenstette,”Genetic algorithms for machine learning”, 1994, pp. 144.

Mitchell, “An introduction to Genetic Algorithms”, 1999.

Kai Song Goh, Andrew Lin and Brian Rodrigues, “Sexual Selection for Genetic Algorithms”, Artificial Intelligence Review 19, 2003, pp 123–152.

Surabhi Gupta, “Relative fitness scaling for improving efficiency of proportionate selection in genetic algorithms”, Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference, ACM, New York, NY, USA , GECCO '09 , ©2009.

Keki M. Burjorjee, “Generative Fixation”, November 2010.

ADRIAN HOPGOOD, ALEKSANDRA MIERZEJEWSKA, “TRANSFORM RANKING: A NEW METHOD OF FITNESS SCALING IN GENETIC ALGORITHMS”, DECEMBER 2008.


Refbacks

  • There are currently no refbacks.