A Rank based Adaptive Mutation in Genetic Algorithm

by   Avijit Basak, et al.

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.



There are no comments yet.


page 4

page 5

page 6


The quasispecies regime for the simple genetic algorithm with roulette-wheel selection

We introduce a new parameter to discuss the behavior of a genetic algori...

Fitness-based Adaptive Control of Parameters in Genetic Programming: Adaptive Value Setting of Mutation Rate and Flood Mechanisms

This paper concerns applications of genetic algorithms and genetic progr...

Detecting Communities in Complex Networks using an Adaptive Genetic Algorithm and node similarity-based encoding

Detecting communities in complex networks can shed light on the essentia...

An Adaptive Genetic Algorithm for Solving N-Queens Problem

In this paper a Metaheuristic approach for solving the N-Queens Problem ...

Deriving Smaller Orthogonal Arrays from Bigger Ones with Genetic Algorithm

We consider the optimization problem of constructing a binary orthogonal...

Novel Adaptive Genetic Algorithm Sample Consensus

Random sample consensus (RANSAC) is a successful algorithm in model fitt...

Intelligent Algorithm for Optimum Solutions Based on the Principles of Bat Sonar

This paper presents a new intelligent algorithm that can solve the probl...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.