arrow
返回

A Pareto Front grid guided multi-objective evolutionary algorithm

delete2023-03-01
delete15
PRE
AI
许莹 封面图
许莹 (Ying Xu) *
H
Huan Zhang
L
Lei Huang
Rong Qu 封面图
Rong Qu (Rong Qu)
Y
Yusuke Nojima
DOI:10.1016/j.asoc.2023.110095delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
For multi-objective optimization problems with irregular Pareto Fronts, most widely used decomposition methods in MOEA/D (multi-objective evolutionary algorithms based on decomposition) have shown to be lack of the ability to balance the diversity and the convergence to track the true Pareto Fronts during the search. This research investigates the recently proposed grid-based decomposition methods, which reflect the inherent characteristics of the neighborhood structure in the solution to address the issues of diversity and convergence. The performance of the grid-based decomposition method, however, depends on the size of its grid segmentation, and its time complexity increases with the number of grids. In order to improve the computational efficiency, we propose a new concept of Pareto Front grid to guide the search in MOEA. In order to reduce the computing time, a new nadir point estimation strategy based on statistical analysis has been proposed to estimate the whole population. In addition, based on the idea of knee point, a novel grid-based knee point selection method is proposed in the environmental selection of the next generation. Finally, a grid-based decomposition multi-objective evolutionary algorithm with Pareto Front Grid (PFG-MOEA) is proposed. Extensive experimental analysis demonstrates the effectiveness of the proposed PFG-MOEA against state-of-the-art multi-objective evolution algorithms. As the extension of the CDG-MOEA (Constrained Decomposition approach with Grids MOEA) algorithm in the literature, PFG-MOEA can obtain better performance by consuming much less computing time. (c) 2023 Elsevier B.V. All rights reserved.
Keyword:
Evolutionary multi-objective optimization
Pareto Front
MOEA

期刊

Applied Soft Computing 封面图
Applied Soft Computing
IF:
6.6
论文数:
1.4W
被引数:
4.8W

机构

O
Osaka Metropolitan University
学者数:
1.2W
论文数: 9.7K
被引数: 1.6K
U
University of Nottingham
学者数:
3.4W
论文数: 3.2W
被引数: 5.5W
H
hunan university
学者数:
4.5W
论文数: 3.3W
被引数: 70
学者 查看更多机构
引用论文

引用论文

Constrained Subproblems in a Decomposition-Based Multiobjective Evolutionary Algorithm
err2016-06-01
err125
PREAI
errWang, Luping; Zhang, Qingfu; Zhou, Aimin; Gong, Maoguo; Jiao, Licheng
err分享
err收藏
On Set-Based Multiobjective Optimization
err2010-02-01
err126
PREAI
errZitzler, Eckart; Thiele, Lothar; Bader, Johannes
err分享
err收藏
err分享
err收藏
学者 查看更多内容