arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.11591cs.NEcs.AI

Scalable and Customizable Benchmark Problems for Many-Objective Optimization

Instituto Federal de Educação, Ciência e Tecnologia de Minas Gerais (IFMG)(米纳斯吉拉斯联邦教育科学技术学院(IFMG));Federal University of Minas Gerais(米纳斯吉拉斯联邦大学);Graduate Program in Electrical Engineering - Federal University of Minas Gerais(米纳斯吉拉斯联邦大学电气工程研究生项目);Machine Intelligence and Data Science (MINDS) Laboratory, Federal University of Minas Gerais (UFMG)(米纳斯吉拉斯联邦大学(UFMG)机器智能与数据科学(MINDS)实验室);Institute of Polyners and Composites, University of Minho (Uminho)(米尼奥大学(Uminho)聚合物与复合材料研究所)

Ivan Reinaldo Meneghini, Marcos Antonio Alves, António Gaspar-Cunha, Frederico Gadelha Guimarães

英文摘要:

Solving many-objective problems (MaOPs) is still a significant challenge in the multi-objective optimization (MOO) field. One way to measure algorithm performance is through the use of benchmark functions (also called test functions or test suites), which are artificial problems with a well-defined mathematical formulation, known solutions and a variety of features and difficulties. In this paper we propose a parameterized generator of scalable and customizable benchmark problems for MaOPs. It is able to generate problems that reproduce features present in other benchmarks and also problems with some new features. We propose here the concept of generative benchmarking, in which one can generate an infinite number of MOO problems, by varying parameters that control specific features that the problem should have: scalability in the number of variables and objectives, bias, deceptiveness, multimodality, robust and non-robust solutions, shape of the Pareto front, and constraints. The proposed Generalized Position-Distance (GPD) tunable benchmark generator uses the position-distance paradigm, a basic approach to building test functions, used in other benchmarks such as Deb, Thiele, Laumanns and Zitzler (DTLZ), Walking Fish Group (WFG) and others. It includes scalable problems in any number of variables and objectives and it presents Pareto fronts with different characteristics. The resulting functions are easy to understand and visualize, easy to implement, fast to compute and their Pareto optimal solutions are known.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑