Simple Genetic Algorithm
A simple code that illustrates a basic Genetic Algorithm
Problem: Maximize f(x) = x(8-x) where 0<=x<=8
Author: Shouvik Chakraborty (B.Tech, 2nd Year),
shouvikchakraborty51@gmail.com
Please Cite:
Chakraborty, S., Seal, A., & Roy, M. (2015, February). An elitist model for obtaining alignment of multiple sequences using genetic algorithm. In 2nd national conference NCETAS (Vol. 4, No. 9, pp. 61-67).
Input parameters
P = Number of population
G = Number of generations
cp = Crossover probability
mp = Mutation probability
nb = Number of bits in each chromosome. Suppose we have 0<=x<=8. So there are 9 values. So we need at least 4 bits to encode them (because 2^3<9).
Output parameters
fitness = Best fitness value of the function used
param_val = Value of the variable (suppose x) for which best fitness occur
引用格式
Chakraborty, S., Seal, A., & Roy, M. (2015, February). An elitist model for obtaining alignment of multiple sequences using genetic algorithm. In 2nd national conference NCETAS (Vol. 4, No. 9, pp. 61-67).
| 版本 | 已发布 | 发行说明 | Action |
|---|---|---|---|
| 1.0.0 |
