"Optimal" mutation rates for genetic search
Proceedings of the 8th annual conference on Genetic and evolutionary computation
International Journal of Distributed Systems and Technologies
Hi-index | 0.00 |
Genetic Algorithms have been used to solve difficult optimization problems in a number of fields. However, in order to solve a problem with GA, the user has to specify a number of parameters.allThis parameter tuning is a difficult task as different genetic operators are suitable in different application areas. This paper proposes a scheme for genetic algorithms where the genetic operators are changed randomly. The information of gender and age is also incorporated in this approach to maintain population diversity. The experimental result of the proposed algorithm based on a mechanical design problem shows promising result.