Scribd
Upload
30 views14 pages

Maths PRESENTATION

The document presents a project using genetic algorithms to solve an unconstrained nonlinear programming problem. It discusses genetic algorithms, specifying the problem as optimizing a nonlinear function using genetic algorithms. It describes the components of genetic algorithms, including the source code, and lists advantages like global optimization and disadvantages like computational complexity. It concludes genetic algorithms are a versatile optimization technique for complex problems.

Uploaded by

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

Maths PRESENTATION

The document presents a project using genetic algorithms to solve an unconstrained nonlinear programming problem. It discusses genetic algorithms, specifying the problem as optimizing a nonlinear function using genetic algorithms. It describes the components of genetic algorithms, including the source code, and lists advantages like global optimization and disadvantages like computational complexity. It concludes genetic algorithms are a versatile optimization technique for complex problems.

Uploaded by

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

DEPARTMENT OF ELECTRICAL ENGINEERING

MATHS
PRESENTATION

PRESENTED BY:-
IN THE GUIDANCE OF :- GAURAV DEV
Dr. PRIYANKA ASHOK HARJULE PIYUSH PAREWA
VAIBHAV
[Ass.proffessor (mathematics)] HARSH
LAVKUSH JATAV
CONENT :-
1] Introduction
2] Problem specification
3] Solution of the problem
4] Source code
5] Advantages and disadvantages of
genetic algorithm
6] Conclusion
PROJECT DESCRIPTION

Computer program for solving a unconstrained


Nonlinear Programming problem through any of the
metaheuristic algorithm.
GENETIC ALGORITHM

• Genetic Algorithms are intelligent


search techniques maintaining a
population of candidate solutions
for a given problem and search the
solution space by applying
variation operators.
What is Genetic Algorithm?

•The genetic algorithm is a method for solving both


constrained and unconstrained optimization problems that is
based on natural selection, the process that drives biological
evolution. The genetic algorithm repeatedly modifies a
population of individual solutions. At each step, the genetic
algorithm selects individuals from the current population to
be parents and uses them to produce the children for the next
generation. Over successive generations, the population
"evolves" toward an optimal solution.
•
PROBLEM SPECIFICATION:

OPTIMIZE THE NON LINEAR PROGRAMMING

PROBLEM USING GENETIC ALGORITHM .

F(x) = x^2
HOW GENETIC ALGORITHM WORKS ?
SOURCE CODE :
• .
OUTPUT :-
ADVANTAGES OF GENETIC ALGORITHM

• 1. EXPLORATION OF SEARCH SPACE

• 2. FLEXIBILITY

• 3. ADAPTABILITY

• 4.PARALLEL PROCESSING

• 5.GLOBAL OPTIMISATION
DISADVANTAGES OF GENETIC ALGORITHM

• 1. COMPUTATIONAL COMPLEXITY

• 2. DIFFICULTY IN TUNING PARAMETERS

• 3. DEPENDENCE ON RANDOMNESS

• 4. RISK OF PREMATURE CONVERGENCE

• 5. LIMITED UNDERSTANDING OF RESULTS


CONCLUSION :-

GENETIC ALGORITHMS ARE A VERSATILE


OPTIMIZATION TECHNIQUE THAT CAN FIND
SOLUTIONS TO A WIDE RANGE OF COMPLEX
PROBLEMS . THEY ARE PARTICULARLY USEFUL
WHEN OTHER OPTIMIZATION METHODS MAY NOT
BE SUITABLE OR WHEN AN ANALYTICAL
SOLUTION IS NOT READILY AVAILABLE.
THANK YOU

You might also like