Automated operator selection on Genetic Algorithms
Genetic Algorithms (GAs) have proven to be a useful means of finding optimal or near optimal solutions to hard problems that are difficult to solve by other means. However, determining which crossover and mutation operator is best to use for a specific problem can be a complex task requiring much trial and error. Furthermore, different operators may be better suited to exploring the search space at different stages of evolution. For example, crossover and mutation operators that are more likely to disrupt fit solutions may have a less disruptive effect and better search capacity during the early stages of evolution when the average fitness is low. This paper presents an automated operator selection technique that largely overcomes these deficiencies in traditional GAs by enabling the GA to dynamically discover and utilize operators that happen to perform better at finding fitter solutions during the evolution process. We provide experimental results demonstrating the effectiveness of this approach by comparing the performance of our automatic operator selection technique with a traditional GA.
Please refer to publisher version or contact your library.