Adaptive Reference Vector Generation for Inverse Model Based Evolutionary Multiobjective Optimization with Degenerate and Disconnected Pareto Fronts

被引:59
作者
Cheng, Ran [1 ]
Jin, Yaochu [1 ,3 ]
Narukawa, Kaname [2 ]
机构
[1] Univ Surrey, Dept Comp, Guildford GU2 7XH, Surrey, England
[2] Honda Res Inst Europe GmbH, D-63073 Offenbach, Germany
[3] Donghua Univ, Coll Informat Sci & Technol, Shanghai 201620, Peoples R China
来源
EVOLUTIONARY MULTI-CRITERION OPTIMIZATION, PT I | 2015年 / 9018卷
关键词
Multiobjective optimization; Model based evolutionary optimization; Inverse modeling; Reference vectors; ALGORITHM;
D O I
10.1007/978-3-319-15934-8_9
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
Inverse model based multiobjective evolutionary algorithm aims to sample candidate solutions directly in the objective space, which makes it easier to control the diversity of non-dominated solutions in multiobjective optimization. To facilitate the process of inverse modeling, the objective space is partitioned into several subregions by predefining a set of reference vectors. In the previous work, the reference vectors are uniformly distributed in the objective space. Uniformly distributed reference vectors, however, may not be efficient for problems that have nonuniform or disconnected Pareto fronts. To address this issue, an adaptive reference vector generation strategy is proposed in this work. The basic idea of the proposed strategy is to adaptively adjust the reference vectors according to the distribution of the candidate solutions in the objective space. The proposed strategy consists of two phases in the search procedure. In the first phase, the adaptive strategy promotes the population diversity for better exploration, while in the second phase, the strategy focused on convergence for better exploitation. To assess the performance of the proposed strategy, empirical simulations are carried out on two DTLZ benchmark problems, namely, DTLZ5 and DTLZ7, which have a degenerate and a disconnected Pareto front, respectively. Our results show that the proposed adaptive reference vector strategy is promising in tacking multiobjective optimization problems whose Pareto front is disconnected.
引用
收藏
页码:127 / 140
页数:14
相关论文
共 16 条
[1]
[Anonymous], 2011, EXPT MIXTURES DESIGN
[2]
The balance between proximity and diversity in multiobjective evolutionary algorithms [J].
Bosman, PAN ;
Thierens, D .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2003, 7 (02) :174-188
[3]
Cheng R., 2015, IEEE T EVOL IN PRESS
[4]
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[5]
A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[6]
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[7]
Giagkiozis I., 2014, EVOLUTIONAR IN PRESS
[8]
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach [J].
Jain, Himanshu ;
Deb, Kalyanmoy .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :602-622
[9]
Jin Y, 2003, IEEE C EVOL COMPUTAT, P1910
[10]
Decomposition of a Multiobjective Optimization Problem into a Number of Simple Multiobjective Subproblems [J].
Liu, Hai-Lin ;
Gu, Fangqing ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (03) :450-455