ON

AB SESSION 09: Population Based

Searching: Genetic Algorithms
ate oftheSession: Time oftheSession: to
rerequisite
.Local SearchingMethods
re-Lab:
1, Differentiate between Local Based Search
algorithms and Population Based Searchalgorithms.
local SRaNch Means tho rav solotion 15
GONche relqhborhood of Ao wrrentsollution
gecdy search meaus uar lo navolUFion is
tosen maximo an improvoen (ntenon

Cardiat).
2. Explain the working of GeneticAlgorithm.
optimiation
avch-baed
enetic Alqorithn 6 d

on pinoplo ot Cenetic)
fechnique moed
and MtoYa 6eleuion. tE is freaon tly

fHnd optima
What are chromosomes in geneticalgorithms?
3.
a Chomoso@ is a e t
In uotic algorthms
proposed oltion o
uhich dfine a
asamereys
rhe prDbern Har

6 Golue
4. Describe crossing over in GeneticAlgorithms

qeotic
algonthms ad valtiouy Compotidtion
al60 Coled oombiralton is aGeueric
(ombino o geotic in fwnatin
(
per ahon ed
navott spring
panents 4euo raho
56
iva Questions: 18CS3064 BIG DATA
OPTIMIZATION
1. Write about
Genetic
CYossovev f6AlgorithmsCrossover?
a
qpnetic operator ud to vary
0
prDgrdmming cf a ChYonDsomO of chromogbmO fom
one ge neration to nex
on
2. What are
CrossoverOperators?
The Coasover operatovs OBemen u biologica
r06Sing oveY and oombi nalim of chromosomgoin
3. What are
MutationOperators? ceu meiss
the motai on pevatov andomly Elips irdividua bis
in he nao Chomsomo)
4. What is
GeneticAlgorithms ParentSelection?
doge of a algonthm
seelhon P6 w GUOtic
do chosen frm
whichb indiviàun genong
a pepo(ahio)
5. List out the conditions for Genetic AlgorithmsTermination.
PProY
wr Lore ta been no improvem ent inílo
reach an absolukO numbe of geuovation
when ue
hA Oched a
when o tbs funuhio0 alue
Cepun pre-efiwd Valve
(For Evaluator's use only)
Comment ofthe Evaluator (ifAny) Evaluators Observation
MarksSecured: outof
Full Name of the Evaluator:
Signature of the Evaluator Date of Evaluation:
60