NSGA-Ⅱ算法是 Srinivas 和 Deb 于 2000 年在 NSGA 的基础上提出的，它比 NSGA算法更加优越：它采用了快速非支配排序算法，计算复杂度比 NSGA 大大的降低；采用了拥挤度和拥挤度比较算子，代替了需要指定的共享半径 shareQ，并在快速排序后的同级比较中作为胜出标准，使准 Pareto 域中的个体能扩展到整个 Pareto 域，并均匀分布，保持了种群的多样性；引入了精英策略，扩大了采样空间，防止最佳个体的丢失，提高了算法的运算速度和鲁棒性。
2021-05-23 08:59:55
6KB
1
NSGA2算法，MATLAB实现，自定义目标函数，封装完整。更多内容请访问http://www.omegaxyz.com/
2019-12-21 22:07:23
17KB
1
遗传算澍I】(GA)是一种“产生——评价”型的通用型群体并行迭代优化算法，近年来得到了
广泛关注和应用。
2019-12-21 21:07:46
306KB
1
NSGA [5] is a popular non domination based genetic algorithm for multi
objective optimization It is a very e ective algorithm but has been generally
criticized for its computational complexity lack of elitism and for choosing the
optimal parameter value for sharing parameter share A modiˉed version NSGA
II [3] was developed which has a better sorting algorithm incorporates elitism
and no sharing parameter needs to be chosen a priori NSGA II is discussed in
detail in this ">NSGA [5] is a popular non domination based genetic algorithm for multi
objective optimization It is a very e ective algorithm but has been generally
criticized for its computational complexity lack of elitism and for choosing the
optimal parameter value for sharing parameter share A modiˉ [更多]
2019-12-21 19:28:58
22KB
1