Published on Sun Apr 18 2021

A Rank based Adaptive Mutation in Genetic Algorithm

Avijit Basak
0
0
0
Abstract

Traditionally Genetic Algorithm has been used for optimization of unimodal and multimodal functions. Earlier researchers worked with constant probabilities of GA control operators like crossover, mutation etc. for tuning the optimization in specific domains. Recent advancements in this field witnessed adaptive approach in probability determination. In Adaptive mutation primarily poor individuals are utilized to explore state space, so mutation probability is usually generated proportionally to the difference between fitness of best chromosome and itself (fMAX - f). However, this approach is susceptible to nature of fitness distribution during optimization. This paper presents an alternate approach of mutation probability generation using chromosome rank to avoid any susceptibility to fitness distribution. Experiments are done to compare results of simple genetic algorithm (SGA) with constant mutation probability and adaptive approaches within a limited resource constraint for unimodal, multimodal functions and Travelling Salesman Problem (TSP). Measurements are done for average best fitness, number of generations evolved and percentage of global optimum achievements out of several trials. The results demonstrate that the rank-based adaptive mutation approach is superior to fitness-based adaptive approach as well as SGA in a multimodal problem space.

Mon Jul 22 2013
Neural Networks
Rotational Mutation Genetic Algorithm on optimization Problems
Optimization problem, nowadays, have more application in all major but they have problem in computation. Calculation of the optimum point in the spaces with the above dimensions is very time consuming. In this paper, RM algorithm is implemented by GA.
0
0
0
Sun Jul 21 2013
Neural Networks
A New Optimization Approach Based on Rotational Mutation and Crossover Operator
Evaluating a global optimal point in many global optimization problems in large space is required to more calculations. This proposed method (RMC) starts from the point which has best fitness value by elitism mechanism. After that, rotational mutation and crossover operator are used to reach optimal point.
0
0
0
Fri Feb 26 2016
Neural Networks
Enhancing Genetic Algorithms using Multi Mutations
Mutation is one of the most important stages of the genetic algorithm because of its impact on the exploration of global optima. This paper investigates the use of more than one mutation operator to enhance the performance of genetic algorithms. The results show the importance of some of the proposed methods.
0
0
0
Tue May 21 2013
Neural Networks
Improving NSGA-II with an Adaptive Mutation Operator
The performance of a Multiobjective Evolutionary Algorithm (MOEA) is critically dependent on the parameter setting of the operators. The most desired control of such parameters presents the characteristic of adaptiveness, i.e., the capacity of changing the value of the parameter.
0
0
0
Wed Mar 14 2012
Neural Networks
Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem
The Travelling Salesman Problem (TSP) is a combinatorial problem. A genetic algorithm includes some parameters that should be adjusted, so as to get reliable results.
0
0
0
Tue Sep 06 2011
Neural Networks
Application of the Modified 2-opt and Jumping Gene Operators in Multi-Objective Genetic Algorithm to solve MOTSP
This paperstudies the role of a local search technique called 2-opt for the Multi-Objective Travelling Salesman Problem (MOTSP) A new mutation operator called Jumping Gene (JG) is also used.
0
0
0