Thanks a lot @StudyKorner. Just a question: if pareto front 2 should be ordered descending by crowding distance, then the correct order is [3,b,d,1], isn't it?
if solutions are in same front then compare the crowding distance of each to decide better solution, we generally prefer the solutions with large crowding distance. Otherwise, if solutions are in different fronts then, solutions with better front wins the tournament.
![NSGA-II Optimization: Understand fast how it works [complete explanation]](http://i.ytimg.com/vi/SL-u_7hIqjA/mqdefault.jpg)
Thanks a lot @StudyKorner. Just a question: if pareto front 2 should be ordered descending by crowding distance, then the correct order is [3,b,d,1], isn't it?
Dear Sir, How dis you set for fmax = 1 and fmin = 0.1 , fmax = 60 and fmin = 0?
Tq
What if you have (5,e) in tournament selection. Both of them have crowding distance of infinity, which one do you choose?
Thank you for your effort
Thank you very much...Very well explained..
Thank you! Amazing video!
how f2max/min are 1 and 0.1 respectively?
kartik kejariwal assumption
The max/min should be obtained among the f value if not mistaken. Shouldn't be assumption.
how is f1max - f1min 1-0,1 and f2max-f2min 60-0?
How do you determine which solutions from P go up against each other in the tournament selection? (i.e. 5 & e, a & 3, 1 & b, etc...)
if solutions are in same front then compare the crowding distance of each to decide better solution, we generally prefer the solutions with large crowding distance. Otherwise, if solutions are in different fronts then, solutions with better front wins the tournament.
Nice video
uncle ji -2
NICE EXPLANATION