بالعربي Non-Dominated Sorting Genetic Algorithm II (NSGA-II) Step-by-Step

  Рет қаралды 4,260

Ahmed Gad

Ahmed Gad

Күн бұрын

Пікірлер: 14
@tareqtheghosete
@tareqtheghosete 2 ай бұрын
Wallahi your presentation is so professional. Thanks alot.
@AhmedGadd
@AhmedGadd 2 ай бұрын
Thanks so much!
@gkamel9929
@gkamel9929 Жыл бұрын
Thank U for sharing. Great job
@tfarrag1981
@tfarrag1981 Жыл бұрын
Great dr ahmed
@Hendabdelaziz
@Hendabdelaziz Жыл бұрын
جزاك الله خيرا
@mahmoudezzat5460
@mahmoudezzat5460 2 ай бұрын
thank you very much ♥
@AhmedGadd
@AhmedGadd 2 ай бұрын
Appreciated!
@tareqtheghosete
@tareqtheghosete 2 ай бұрын
Great Job but i hope you complete the explanation for the crossover and the mutation.
@AhmedGadd
@AhmedGadd 2 ай бұрын
Thanks. They are explained in another video: kzbin.info/www/bejne/qZvHlYt_mMR1aJIsi=DAay0HURAw8j26lP
@better398
@better398 6 ай бұрын
روعه استاذ
@samirlamin4057
@samirlamin4057 6 ай бұрын
Thank you so much
@gkamel9929
@gkamel9929 Жыл бұрын
Sir, the solution G is better in the Feedback than the solution H, E and B. Because the Feedback of G is 4.0 but the others solutions are 4.6, 4.5 and 4.4. So, the solution G is also in the front 2.
@AhmedGadd
@AhmedGadd 11 ай бұрын
Thanks for your comment! But solution G cannot be part of Front 2 because solution C dominates it. Solution C is better than solution G in all the objectives. Note that all the objective functions are minimization. For Cost, solution C has 65 which is better than 80 for G. For Feedback, solution C has 3.5 which is better than 4.5 for G. As solution C is better than solution G in all the objective functions, this means solution C dominates solution G. Thus, solution G cannot be part of Front 2.
@amelnaitamer9305
@amelnaitamer9305 9 ай бұрын
Thank you for this video which explains the NSGAII very well, I was not able to understand before despite the different sites and videos that I saw. I have a question, I would like to apply the NSGAII for a problem of placing equipment for which I have dimensions (lengths, widths) on a surface for which I also have the dimension. My goal is to have different combinations of equipment inside the surface. I have as constraint that the equipment does not overlap and that they are all inside the surface. Once I have defined my objective functions and apply the algorithm, how can I visually represent the different equipment placed on the predefined serface? I can't really visualize how this algorithm can provide me differents combinations since NSGA2 is the most popular algorithm in placement problems. Thanks for your help !
Quando A Diferença De Altura É Muito Grande 😲😂
00:12
Mari Maria
Рет қаралды 45 МЛН
Леон киллер и Оля Полякова 😹
00:42
Канал Смеха
Рет қаралды 4,7 МЛН
99.9% IMPOSSIBLE
00:24
STORROR
Рет қаралды 31 МЛН
IL'HAN - Qalqam | Official Music Video
03:17
Ilhan Ihsanov
Рет қаралды 700 М.
NSGA II - Traveling Salesman Problem
18:47
Cristian Camilo Erazo Agredo
Рет қаралды 6 М.
Multiobjective optimization & the pareto front
6:03
Eric Delmelle
Рет қаралды 27 М.
Genetic Algorithm -شرح للالجورزم
17:04
Tech with Kareem
Рет қаралды 28 М.
The soundness and completeness of logic
14:31
All Angles
Рет қаралды 25 М.
Multiobjective optimization
5:49
OpenMDAO
Рет қаралды 10 М.
Genetic Algorithm - General idea of GA -(Example) شرح بالعربي
19:53
Quando A Diferença De Altura É Muito Grande 😲😂
00:12
Mari Maria
Рет қаралды 45 МЛН