数学优化
极限(数学)
趋同(经济学)
选择(遗传算法)
计算机科学
帕累托原理
简单(哲学)
多目标优化
帕累托最优
价值(数学)
数学
人工智能
经济
机器学习
认识论
数学分析
哲学
经济增长
作者
Jun Ouyang,Feng Yang,Shiwen Yang,Zaiping Nie
标识
DOI:10.1163/156939308784160703
摘要
The multi-objective optimization NSGA-II approach has been proved that, in most of times, it has much better spread of solutions and better convergence near the true Pareto-optimal than mostly Pareto-optimal method. But there are also disadvantages to restrict the spread uniformity in some problems. This paper overcomes these disadvantages to get three modifications such as the cumulate dummy fitness strategy, disconnected filling strategy, and throwing off strategy by selection limit. The comparison with simple NSGA-II shows that the great efficiency is achieved by using the improved NSGA-II in most of times, because the improved approach can spread value space and give a more reasonable rule for preponderant individuals.
科研通智能强力驱动
Strongly Powered by AbleSci AI