Scribd
Upload
3 views12 pages

Genetic Algorithm

A genetic algorithm is a heuristic search method inspired by natural evolution, utilizing processes such as selection, crossover, and mutation to evolve solutions to problems. It consists of five phases: Initialization, Fitness Assignment, Selection, Crossover, and Termination, where individuals (chromosomes) are created and evolved through the exchange of genes. Genetic algorithms have applications in various fields, including image processing and artificial creativity.

Uploaded by

ranumandol
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
3 views12 pages

Genetic Algorithm

A genetic algorithm is a heuristic search method inspired by natural evolution, utilizing processes such as selection, crossover, and mutation to evolve solutions to problems. It consists of five phases: Initialization, Fitness Assignment, Selection, Crossover, and Termination, where individuals (chromosomes) are created and evolved through the exchange of genes. Genetic algorithms have applications in various fields, including image processing and artificial creativity.

Uploaded by

ranumandol
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
* A genetic algorithm is a heuristic search algorithm that is inspired by Charles Darwin’s theory of natural evolution. * This algorithm reflects the process of natural selection where the fittest a— individuals are selected for reproduction in order to produce offspring of the next generation. Genetic Algorithms are being widely used in different real-world applications, for example, image processing, Designing electronic circuits, code-bygaking, and artificial creativity. There are five phases in Genetic Algorithm: Initialization Fitness Assignment Selection Crossover (Reproduction) Termination Initial Population * The process begins with a set of individuals which is called a Population. * Each individual is a solution to the problem you want to solve known as Chromosome. + An individual is characterized by a set of parameters (variables) known as Genes. + Genes are joined into a string to form a Chromosome (solution). Gere Chromosome Crossover * Crossover is the most significant phase in a genetic algorithm. + For each pair of parents to be mated, a crossover point is chosen at random from within the genes. * For example, consider the crossover point to be 3 as shown. Offspring * Offspring are created by exchanging the genes of —_— —_—_. _—- —— parents among themselves until the crossover point is reached. Al A2 Mutation In certain new offspring formed, some of their genes can be subjected to a mutation with a low random probability. This implies that some of the bits in the bit string can be flipped. "Re Mutation 5 1/1 1 After Mutation AS 1/1 Termination + The algorithm terminates if the population has converged (does not produce offspring which are significantly different from the __ previous generation). 1 2 3 4 sum Average Maximum 01100 11001 00101 10011 12 25 19 144 625 25 181 1155 288.75, 625 0.1247 0.5411 0.0216 0.3126 1.0 0.25 0.5411 12.47 54.11 2.16 31.26 100 25 54.11 f@) Expected Count = Avg fe) oe To ness SSS ae Xvalue | F(x) 2 01100 01101 169 Vv 2 11001 i 11000 24 576) 3 11001 11011 27 729 4 10011 7 10001 17 289 sum 1763 Average 440.75 Maximum 729 Me) Cae fue reed Cae ei) ie) ae a 01101 10000 11101 29 2 11000 00000 11000 24 3 11011 00000 11011 27 4 10001 00101 10100 20 Sum Average Maximum gos 6

You might also like