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.
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.
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 !
Wallahi your presentation is so professional. Thanks alot.
Thanks so much!
جزاك الله خيرا
Thank U for sharing. Great job
Great Job but i hope you complete the explanation for the crossover and the mutation.
Thanks. They are explained in another video: ruclips.net/video/sjddXIc_B20/видео.htmlsi=DAay0HURAw8j26lP
Great dr ahmed
روعه استاذ
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.
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.
thank you very much ♥
Appreciated!
Thank you so much
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 !