Genetic Algorithm Modification Analysis Of Mutation Operators In Max One Problem

Max One Problem is the simplest problem that only performs the calculation of the maximum value from a number of binary strings. Usually, Max One Problem is used to represent an algorithm i.e. Genetic Algorithm. This paper will discuss how genetic algorithms work to solve the problems of Max One. However, the genetic algorithm will be modified in the algebraic process stages in the mutation operator. As in modified genetic algorithms without the use of crossover processes, and modified of genetic algorithms without the use of selection and crossover processes. Later, the result will be compared with conventional genetic algorithms. The purpose of this comparison is to see whether the modified genetic algorithm process can produce different results than conventional genetic algorithms and can provide a variety of methods to solve a problem. In this paper, the variation of modified method of the genetic algorithm is expected to solve problems other than the problem of Max One.