Genetic Algorithms - Explanation & Implementation

preview_player
Показать описание
In this video, I will be explaining how genetic algorithms work with examples and my own code implementation at the end.

Рекомендации по теме
Комментарии
Автор

presentation was well organised and the breaks inbetween chapters felt like they came from a tarintino movie

TheAnnoor
Автор

while doing crossover why do we choose the 1st and 2nd best for single pt . ? and then 2nd and 3rd for double pt. ? LIke what's the reason behind doing so ?

angrytomato
Автор

Since you know the fitness function, the solution is easy. The crossover algorithm can only make the best of the random values you started with. If there were no 9s in the original selection then the optimal solution is out of reach without mutation (unless you apply it to all 10^8 population). How about a rule that if pair1 is even then mutate, else crossover - tough to find a solution that won't occasionally mutate away from optimal

RupertBruce
Автор

Sir you did 3 times crossover here, which produced 6 offsprings. If in my case, I just want to do 1 times in a cycle, will it be a problem?

muhammadyezabaihaqi
Автор

this video is really helpful to understand GA. Anyway, I have comment for the necessity of mutation. Another source that i have says that" mutation is exploitation and crossover is exploration ", and it's contradiction with yours. Is there an explanation about this? thanks

hafidzizzudin
Автор

Nice actually very nice...keep uploading :)

shashisuman
Автор

this was a f*cking question at our exam..hello 'teacher'

dracoon
Автор

Sir i understood the concept but how you found the optimum solution directly

manideepreddy
Автор

I can't see the code, can you send me please .

gulleranacanadian
Автор

Nice video but could use a LOT more explanation.

sgrimm