Multi-Operator Genetic Algorithm for Dynamic Optimization Problems

Al-khafaji Amen


Maintaining population diversity is the most notable challenge in solving dynamic optimization problems (DOPs). Therefore, the objective of an efficient dynamic optimization algorithm is to track the optimum in these uncertain environments, and to locate the best solution. In this work, we propose a framework that is based on multi operators embedded in genetic algorithms (GA) and these operators are heuristic and arithmetic crossovers operators. The rationale behind this is to address the convergence problem and to maintain the diversity. The performance of the proposed framework is tested on the well-known dynamic optimization functions i.e., OneMax, Plateau, Royal Road and Deceptive. Empirical results show the superiority of the proposed algorithm when compared to state-of-the-art algorithms from the literature.


Arithmetic crossover operator, Evolutionary algorithms, Dynamic optimization functions, Genetic algorithm, Heuristic crossover

Full Text:


Total views : 168 times


  • There are currently no refbacks.

View IJAI Stats

Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.