I. Introduction

In daily life as well as in doing research, we might come to problems that require a lowest/highest value of variables, e.g.: find the shortest way from home to work, buying household items with a fixed amount of money, etc. These problems could be called “optimization” and today we will introduce an algorithm to solve these kinds of problem: the Genetic Algorithm.

Genetic Algorithm has been developed by Prof. John Holland in 1975, which search algorithm that mimics the process of evolution. This method is based on the “Survival of the Fittest” concept (Darwinian Theory), i.e.: successive generations are becoming better and better.

II. Algorithm

- Initialization
- Fitness Calculation
- Selection
- Crossing Over
- Mutation
- Repetition of the steps from 2-5 for the new population generated.

The pdf version of this introduction could be found here: Genetic Algorithm

The 2nd part can be found here.

Utpal Kumar

IESAS

### Like this:

Like Loading...

*Related*

[…] To find a basic introduction of GA, the first part can be found here. […]

LikeLike