Enhancing Genetic Algorithms using Multi Mutations

  title={Enhancing Genetic Algorithms using Multi Mutations},
  author={Ahmad Basheer Hassanat and Esra’a Alkafaween and Nedal A. Al-Nawaiseh and Mohammad Ali Abbadi and Mouhammd Alkasassbeh and Mahmoud Bashir Alhasanat},
  journal={PeerJ Prepr.},
Mutation is one of the most important stages of the genetic algorithm because of its impact on the exploration of global optima, and to overcome premature convergence. There are many types of mutation, and the problem lies in selection of the appropriate type, where the decision becomes more difficult and needs more trial and error. This paper investigates the use of more than one mutation operator to enhance the performance of genetic algorithms. Novel mutation operators are proposed, in… 

Figures and Tables from this paper

Choosing Mutation and Crossover Ratios for Genetic Algorithms - A Review with a New Dynamic Approach
New deterministic control approaches for crossover and mutation rates are defined, namely Dynamic Decreasing of high mutation ratio/dynamic increasing of low crossover ratio (DHM/ILC), and Dynamic Increasing of Low Mutation/Dynamic decreasing of High Crossover (ILM/DHC).
Improving TSP Solutions Using GA with a New Hybrid Mutation Based on Knowledge and Randomness
This paper proposes a hybrid mutation operator called "IRGIBNNM", this mutation is a combination of two existing mutations, a knowledge-based mutation, and a random-based mutations, and improves the existing "select best mutation" strategy using the proposed mutation.
On enhancing genetic algorithms using new crossovers
The results show the importance of some of the proposed methods, such as the collision crossover, in addition to the significant enhancement of the genetic algorithms performance, particularly when using more than one crossover operator.
An Improved Genetic Algorithm with a New Initialization Mechanism Based on Regression Techniques
The experimental results show that the performance of the GA that uses the proposed regression-based technique for population seeded outperforms other GAs that uses traditional population seeding techniques such as the random and the nearest neighbor based techniques in terms of error rate, and average convergence.
Combinatorial optimization problem solution based on improved genetic algorithm
Through the experimental results analysis, it is proved that the improved algorithm for solving TSP problems can improve the accuracy and efficiency of the solution.
Different Applications of the Genetic Mutation Operator for Symetric Travelling Salesman Problem
  • V. Kralev
  • Computer Science
    International Journal on Advanced Science, Engineering and Information Technology
  • 2018
The results show that the recursive algorithm can be used successfully to solve the TSP for graphs with a small number of vertices, for instance, 25-30, and it appeared that the use of the genetic mutation operator yields better results when applied to identical solutions.
A Meta-Heuristic Based on Genetic Algorithm for Selecting Bailiffs by Districts
Genetic Algorithm could create solutions as good as the manual process, and it is more stable than SA, especially in the second scenario, in which the search space can reach a size of ≈ 10 possibilities of solutions.
Enhancing Multi-model Inference with Natural Selection
The convergence properties of genetic algorithm (GA) are studied based on the Markov chain theory and used to design an adaptive termination criterion that vastly reduces the computational cost.
New GA Applied Route Calculation for Multiple Robots with Energy Restrictions
A route calculation approach for multiple collaborative robots with energy constraints and base shifting, modelled using the team orienteering problem (TOP) combined with the multiple knapsack problem (MKP).
On Computerizing the Ancient Game of Ṭāb
The results of several experiments show the strategic properties of this game, the strength of the proposed method by making the computer play the game intelligently, and the potential of generalizing their approach to other similar games.


Simultaneously Applying Multiple Mutation Operators in Genetic Algorithms
A new genetic algorithm is proposed, the dynamic mutation genetic algorithm, that simultaneously uses several mutation operators in producing the next generation and performs better than most genetic algorithms with single mutation operators.
Comparison and Analysis of Different Mutation Strategies to improve the Performance of Genetic Algorithm
A comparative analysis of different mutation approaches is presented, based on the distributions for the purpose to examine their performance, evaluate the average improvement of chromosomes and investigate their ability to find solutions with the high precision.
Evolution of Appropriate Crossover and Mutation Operators in a Genetic Process
The dynamic genetic algorithm simultaneously uses more than one crossover and mutation operators to generate the next generation, and it is expected that the really good operators will have an increasing effect in the genetic process.
Automated Crossover and Mutation Operator Selection on Genetic Algorithms
An automated operator selection technique is presented that largely overcomes 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.
A dynamic mutation genetic algorithm
  • T. HongHong-Shung Wang
  • Computer Science
    1996 IEEE International Conference on Systems, Man and Cybernetics. Information Intelligence and Systems (Cat. No.96CH35929)
  • 1996
A new genetic algorithm, the dynamic mutation genetic algorithm (DMGA), is proposed, which uses more than one mutation operator to generate the next generation and expects that really good operators will have an increased effect on the genetic process.
Mutation effects in genetic algorithms with offspring selection applied to combinatorial optimization problems
This contribution proposes a new version of offspring selection by applying it after crossover, but before mutation, and in a series of experiments the similarities and differences of these two approaches are shown and the interplay between mutation and offspring selection is analyzed.
Analysing mutation schemes for real-parameter genetic algorithms
It is observed that a mutation clock implementation is computationally quick and also efficient in finding a solution close to the optimum on four different problems used in this study for both mutation operators.
Mechanisms to Avoid the Premature Convergence of Genetic Algorithms
Two mechanisms to avoid the premature convergence of genetic algorithms by preserving the population diversity in two different manners are proposed and tested, including the dynamic application of many genetic operators, based on the average progress, and the population partial reinitialization.
Combined Mutation Operators of Genetic Algorithm for the Travelling Salesman Problem
In this study two combined mutation operators have been developed to increase the performance of Genetic Algorithm that helps to find the minimum cost in the known Travelling Salesman problem
Study of Various Mutation Operators in Genetic Algorithms
This paper will discuss different mutation operators that help in solving the travelling sales man problem, which is having a large set of solution.