Dynamic Mutation and Recombination Using Self-Selecting Crossover Method for Genetic Algorithms

Conventional genetic algorithm has drawbacks such as premature convergence and less stability in actual uses. Use conventional mutation and crossover operators should be used is quite difficult and is usually done by trial and error. In this paper, a new genetic algorithm, the genetic algorithm based on a dynamic mutation operator and a dynamic crossover operator using self-selecting crossover method (DMO-DSSCMCO-GA), is introduced. Multimodal function optimization is performed to verify the feasibility and effectiveness. The experiment results show that convergence speed and stability are increased by proposed genetic algorithm, and escaped from premature convergence phenomenon.

[1]  Nikhil,et al.  Directed Mutation in Genetic Algorithms , 2022 .

[2]  Bo Meng,et al.  Research On Dynamics in Group Decision Support Systems Based On Multi-Objective Genetic Algorithms , 2006, 2006 International Conference on Service Systems and Service Management.

[3]  Lawrence. Davis,et al.  Handbook Of Genetic Algorithms , 1990 .

[4]  Yoh-Han Pao,et al.  Combinatorial optimization with use of guided evolutionary simulated annealing , 1995, IEEE Trans. Neural Networks.

[5]  H. Haario,et al.  An adaptive Metropolis algorithm , 2001 .

[6]  Sankar K. Pal,et al.  Directed Mutation in Gennetic Algorithms , 1994, Inf. Sci..

[7]  Goldberg,et al.  Genetic algorithms , 1993, Robust Control Systems with Genetic Algorithms.

[8]  R. R. Saldanha,et al.  Improvements in genetic algorithms , 2001 .