Open AccessFitness-Orientated Mutation Operators in Genetic Algorithms
Author(s) -
Hyung Chul Yoon
Publication year - 2020
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.d1692.029420
Subject(s) - crossover , mutation , fitness landscape , selection (genetic algorithm) , fitness function , genetic algorithm , fitness approximation , operator (biology) , genetic fitness , computer science , mathematical optimization , mutation rate , algorithm , mathematics , artificial intelligence , genetics , population , biology , gene , medicine , repressor , transcription factor , environmental health
Genetic Algorithms are the most popular metaheuristics used in search-based program solving. They search for a solution by repeating the following operators: selection, crossover, and mutation. By going through several generations of these operators, a solution is reached. The total number of generations depends on the reproduction of offspring. Of the reproduction operators, the mutation operator tends to be chosen with a random approach because the concept of mutation is from the natural evolution cycle. But the effectiveness of genetic algorithms should be monitored, especially in software testing. The effectiveness is represented by the total number of generations, which corresponds to the speed of solution acquisition. This work focuses on mutation as a factor in reducing the total number of generations and devises two contrasting ways to define mutation operators. One is fitness-positive, and the other is fitness-negative. The fitness-negative definition thus appears to fit more aptly. This work determines which of these two methods of mutation achieves the higher effectiveness through conducting a controlled experiment. The result shows that the fitness-positive method takes a smaller number of generations than the fitness-negative method.