SGA Implementation Using Integer Arrays for Storage of Binary Strings

Abstract

The Simple Genetic Algorithm evaluates a group of binary strings on the basis of their fitness, performs crossover and mutation on them and tries to generate a group having maximum fitness. The usual method used for implementing the SGA is by using character arrays for storage of binary strings. But, this method has some disadvantages. The SGA implementation can be termed a success if the average fitness of the new generation is more than the initial average fitness. In this paper, we plan to implement the SGA using integer arrays for storage of binary strings. Then, we plan to compare the initial average fitness with the final average fitness so that the working of SGA can be verified. We have written the application such that varying population sizes can be given to check the correctness of the SGA algorithm.