Overview of Genetic Algorithm
Optimization techniques are the techniques used to discover the best solution out of all the possible solutions available under the constraints present. The genetic algorithm is one such optimization algorithm built based on the natural evolutionary process of our nature. The idea of Natural Selection and Genetic Inheritance is used here. Unlike other algorithms, it uses guided random search, i.e., finding the optimal solution by starting with a random initial cost function and then searching only in the space with the least cost (in the guided direction). Suitable when you are working with huge and complex datasets.
What is a Genetic Algorithm?
The genetic algorithm is based on the genetic structure and behavior of the chromosome of the population. The following things are the foundation of genetic algorithms.
- Each chromosome indicates a possible solution. Thus the population is a collection of chromosomes.
- A fitness function characterizes each individual in the population. Therefore, greater fitness better is the solution.
- Out of the available individuals in the population, the best individuals are used to reproduce the next generation offsprings.
- The offspring produced will have features of both the parents and is a result of mutation. A mutation is a small change in the gene structure.
Phases of Genetic Algorithm
Below are the different phases of the Genetic Algorithm:
1. Initialization of Population(Coding)
- Every gene represents a parameter (variables) in the solution. This collection of parameters that forms the solution is the chromosome. Therefore, the population is a collection of chromosomes.
- Order of genes on the chromosome matters.
- Chromosomes are often depicted in binary as 0’s and 1’s, but other encodings are also possible.
2. Fitness Function
- We have to select the best ones to reproduce offspring out of the available chromosomes, so each chromosome is given a fitness value.
- The fitness score helps to select the individuals who will be used for reproduction.
- This phase’s main goal is to find the region where getting the best solution is more.
- Inspiration for this is from the survival of the fittest.
- It should be a balance between exploration and exploitation of search space.
- GA tries to move the genotype to higher fitness in the search space.
- Too strong fitness selection bias can lead to sub-optimal solutions.
- Too little fitness bias selection results in an unfocused search.
- Thus, Fitness proportionate selection is used, also known as roulette wheel selection, as a genetic operator used in genetic algorithms to select potentially useful recombination solutions.
Generation of offsprings happen in 2 ways:
Crossover is the most vital stage in the genetic algorithm. During crossover, a random point is selected while mating a pair of parents to generate offsprings.
There are 3 major types of crossover.
- Single Point Crossover: A point on both parents’ chromosomes is picked randomly and designated a ‘crossover point’. Bits to the right of that point are exchanged between the two parent chromosomes.
- Two-Point Crossover: Two crossover points are picked randomly from the parent chromosomes. The bits in between the two points are swapped between the parent organisms.
- Uniform Crossover: In a uniform crossover, typically, each bit is chosen from either parent with equal probability.
The new offspring are added to the population.
In a few new offspring formed, some of their genes can be subjected to a low random probability mutation. This indicates that some of the bits in the bit chromosome can be flipped. Mutation happens to take care of diversity among the population and stop premature convergence.
5. Convergence (when to stop)
Few rules which are followed which tell when to stop is as follows:
- When there is no improvement in the solution quality after completing a certain number of generations set beforehand.
- When a hard and fast range of generations and time is reached.
- Till an acceptable solution is obtained.
Application of Genetic Algorithm
This section will discuss some of the areas in which the Genetic Algorithm is frequently applied.
1. Traveling and Shipment Routing
The travelling salesman problem is one of the major applications of the genetic algorithm. For example, when a trip planner is asked to plan a trip, he would take the help of a genetic algorithm that reduces the trip’s overall cost and reduces the time.GE is also used for planning the delivery of products from place to place in the best efficient way.
The genetic algorithm is widely used in the field of Robotics. Robots differ from one another by the purpose they are built for. For example, few are built for a cooking task; few are built for teaching tasks.
- Selection of important features in the given dataset.
- In the traditional method, the important features in the dataset are selected using the following method. i.e., You look at the importance of that model, then will set a threshold value for the features, and if the feature has an importance value more than a threshold, it is considered.
- But here, we use a method called a knapsack problem.
- We will again start with a chromosome population, where each chromosome will be a binary string. 1 will denote the “inclusion” of feature in the model, and 0 will denote the “exclusion” of feature in the model.
- The fitness function here will be our accuracy metric of the competition. The more accurate our set of chromosomes in predicting value, the more fit it will be.
- There are many other applications of genetic algorithms like DNA analysis, scheduling applications, Engineering design.
In the current scenario, GE is being used in large manufacturing companies like aircraft to optimize time and resources usage. Further, scientists are working on finding new ways to combine genetic algorithms with other optimization techniques.
This is a guide to What is Genetic Algorithm? Here we discuss the introduction, phases, and applications of the Genetic Algorithm. You can also go through our other suggested articles –