DocumentCode
239031
Title
Multiobjective test problems with complicated Pareto fronts: Difficulties in degeneracy
Author
Hui Li ; Qingfu Zhang ; Jingda Deng
Author_Institution
Sch. of Math. & Stat., Xi´an Jiaotong Univ., Xi´an, China
fYear
2014
fDate
6-11 July 2014
Firstpage
2156
Lastpage
2163
Abstract
It is well-established that the shapes of Pareto-optimal fronts (POFs) can affect the performance of some multiobjective optimization methods. The most well-known characteristics on the shape of POFs are convexity and discontinuity. In this paper, we investigate the construction of multiobjective test problems with complicated POFs, of which its local parts could have mixed dimensionalities. For example, in the case of 3 objectives, some parts of POFs can be 1-D curves while others could be 2-D surfaces. We formulate eight test problems, called CPFT1-8, with such a feature. To study the difficulties of these test problems, we conducted some experiments with two state-of-the-art algorithms MOEA/D and NSGA-II, and analyzed their performances.
Keywords
Pareto optimisation; convex programming; 1D curves; CPFT1-8; MOEA/D; NSGA-II; POF; Pareto-optimal fronts; complicated Pareto fronts; multiobjective optimization methods; multiobjective test problems; state-of-the-art algorithms; Educational institutions; Electronic mail; Linear programming; Manifolds; Optical fibers; Shape;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation (CEC), 2014 IEEE Congress on
Conference_Location
Beijing
Print_ISBN
978-1-4799-6626-4
Type
conf
DOI
10.1109/CEC.2014.6900450
Filename
6900450
Link To Document