可扩展性
多目标优化
计算机科学
数学优化
进化算法
集合(抽象数据类型)
简单
帕累托原理
最优化问题
帕累托最优
机器学习
数学
数据库
认识论
哲学
程序设计语言
作者
Kalyanmoy Deb,Lothar Thiele,Marco Laumanns,Eckart Zitzler
标识
DOI:10.1109/cec.2002.1007032
摘要
After adequately demonstrating the ability to solve different two-objective optimization problems, multi-objective evolutionary algorithms (MOEAs) must show their efficacy in handling problems having more than two objectives. In this paper, we suggest three different approaches for systematically designing test problems for this purpose. The simplicity of construction, scalability to any number of decision variables and objectives, knowledge of exact shape and location of the resulting Pareto-optimal front, and ability to control difficulties in both converging to the true Pareto-optimal front and maintaining a widely distributed set of solutions are the main features of the suggested test problems. Because of these features, they should be useful in various research activities on MOEAs, such as testing the performance of a new MOEA, comparing different MOEAs, and having a better understanding of the working principles of MOEAs.
科研通智能强力驱动
Strongly Powered by AbleSci AI