[go: up one dir, main page]
Scribd
Upload
53 views2 pages

Genetic Algorithm Notes

A Genetic Algorithm is an optimization technique inspired by natural selection that finds optimal solutions through selection, crossover, and mutation. It involves steps such as initialization, evaluation, selection, crossover, mutation, replacement, and termination. Applications span various engineering fields including structural, electrical, mechanical, civil, artificial intelligence, robotics, and chemical engineering.

Uploaded by

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

Genetic Algorithm Notes

A Genetic Algorithm is an optimization technique inspired by natural selection that finds optimal solutions through selection, crossover, and mutation. It involves steps such as initialization, evaluation, selection, crossover, mutation, replacement, and termination. Applications span various engineering fields including structural, electrical, mechanical, civil, artificial intelligence, robotics, and chemical engineering.

Uploaded by

Rahul
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Genetic Algorithm - Study Notes

Basics of Genetic Algorithm

A Genetic Algorithm is a search and optimization technique inspired by natural selection and genetics. It

helps find optimal or near-optimal solutions to complex problems through processes like selection, crossover,

and mutation.

Key Concepts

1. Population: A set of candidate solutions.

2. Chromosome: A representation of a solution.

3. Gene: Part of a chromosome, representing one component of the solution.

4. Fitness Function: Evaluates how well a solution performs.

Steps of Genetic Algorithm

1. Initialization: Generate initial population.

2. Evaluation: Compute fitness of each individual.

3. Selection: Choose parents based on fitness.

4. Crossover: Combine parent genes to produce offspring.

5. Mutation: Introduce small random changes.

6. Replacement: Form a new generation.

7. Termination: Repeat steps until stopping criteria are met.

Working Principle of Genetic Algorithm (Step-by-Step)

1. Start with a randomly generated population of chromosomes.

2. Evaluate the fitness of each chromosome using a fitness function.

3. Select parent chromosomes based on their fitness scores.

4. Perform crossover (recombination) on selected parents to create offspring.

5. Apply mutation to introduce random changes.

6. Replace the old population with the new one.

7. Repeat the process until a stopping criterion is met (e.g., number of generations or satisfactory fitness
Genetic Algorithm - Study Notes

level).

Main Operations of Genetic Algorithm

Selection: Chooses the best-fit individuals to become parents.

Crossover: Combines genes from two parents to produce offspring.

Mutation: Introduces random alterations to maintain diversity.

Elitism: Preserves the best individuals without change for the next generation.

Applications of Genetic Algorithm in Engineering

1. Structural Optimization - For optimal material usage and design.

2. Electrical Engineering - Circuit design and control systems.

3. Mechanical Engineering - Design of machines and dynamic systems.

4. Civil Engineering - Scheduling, resource allocation, and layout design.

5. Artificial Intelligence - Rule-based learning and problem solving.

6. Robotics - Path planning and behavior programming.

7. Chemical Engineering - Process optimization and control.

You might also like