Scribd
Upload
3 views4 pages

Genetic Algorithm for Function Minimization

The document outlines a genetic algorithm used to minimize a function with constraints on variables x and y. It details the steps for generating an initial population of binary-coded solutions, decoding these values, and calculating the objective function. The process includes converting binary values to actual variable values and evaluating the objective function for each solution.

Uploaded by

ggwinop98
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
3 views4 pages

Genetic Algorithm for Function Minimization

The document outlines a genetic algorithm used to minimize a function with constraints on variables x and y. It details the steps for generating an initial population of binary-coded solutions, decoding these values, and calculating the objective function. The process includes converting binary values to actual variable values and evaluating the objective function for each solution.

Uploaded by

ggwinop98
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

Ghenctic AlqeritAro ablemCuit3)

QU a) Genctie algorithn is obe uscd to mininize the funclion 7 y 8ty


such that lSs4and 0s y s 6 Preform the followng [10|
) Gencrate initialpopulation ofS solutions in binary cuded form with
string length as 4,
ü) Obtain the decoded values.
Convert decoded values into actual values of variables.

v) Obtain the values of objective function z.

Binsey shi Mq leugh =4 bits pee Vaeíable


Popu laio Sixe 5 Solutiog
( 4 bits for XT
Tota chzomo Some leugh = 8 bits |4 bits fr y

*Step-I Genrate an Jnitia) Populathoo o 5 bincychomgsomes,


Chaormcsome (8 bits) X-bits y- bits
Solutí on
lo10 O||O |010

O00)
S

S O|00

O000 |00| O000 |00

Obtain De coded Valu es tors 4 bit binay Values(xbits)


2 Cy bits)
I010 |X 2 OX 24IX2' +0X2
2° - 5
= 0x2+ 1X2 tox2' +Ix
t+\X2° 3
2.
Deceded
+ |X2 value)
0000 ox2 + 0x 2 + 0x2 +0x2° - 0
Page
Decoded values os (y bits)
2
+0x2°

+ ox2+ Ox2' +lx2b deco ded


- Ox2 + |x2+ oy2' +ox20- 4 alues
Io01 |x22° +0x2 40x2'+1x2° g

Solution XCDecod ed ) yCdecoded


S

Sa
Ss

Step-T oyext Xcoded alues to actual yaiables fooX y

X= Xmin t may- nin

Hese
2^-1 27-| 15
n= 4 birs, S0

=Ymin t

IIsx<4 min = ),KmaX =4

Page
tor Solution (Si)

2, 3

15

*for Solut on (Se) y = 046-0X9


15

X S y.3.6
2.
Step -V obBainig the Values
ot-obiectiye tuution Z
We kwnoo,tuntton
2

frr solution (Sg ) tos Solution (S)


-x 3
Z = 3x(2-4) + 8 xQn4)
Z36.48

.:. for Sol utin (S a)


Z ,2X(S6) +8X(s6)
Z , l07-52.

yfor soluhion (S4) f Solution ( Sg)


X 1s.
A

Z 34s6
Page
for Solution (S4)
4
23-04

foo solution (ss)


Z = lX (3-6)t 8X(3-6

You might also like