An Operator Based Adaptive Genetic Algorithm

Genetic Algorithms (GAs) are a robust heuristic search technique capable of taking on a broad range of optimization problems. In most GAs, components and parameters are predetermined and remain static throughout its run. In this paper, it is hypothesized that a GA’s performance and robustness can be enhanced through the ‘online’ adaptation of the operators and an operator based adaptive genetic algorithm (AGA) based on these concepts is designed and implemented. A number of permutation based problems were selected to evaluate the performance of AGA.