A Decomposition-based Multi-modal Multi-objective Evolutionary Algorithm with Problem Transformation into Two-objective Subproblems
In some real-world multi-objective optimization problems, Pareto optimal solutions with different design parameter values are mapped to the same point with the same objective function values. Such problems are called multi-modal multi-objective optimization problems (MMOPs). For MMOPs, multi-modal multi-objective evolutionary algorithms (MMOEAs) have been developed for approximating both the Pareto front (PF) and the Pareto sets (PSs). However, most MMOEAs use population convergence in the objective space as the primary evaluation criterion. They do not necessarily have a high PS approximation ability. To better approximate both PF and PSs, we propose a decomposition-based MMOEA where an MMOP is transformed into a number of two-objective subproblems. One objective of each subproblem is a scalarizing function defined by a weight vector for the original MMOP, while the other is defined by a decision space diversity. Experimental results show a high approximation ability of the proposed method for both PF and PSs.
Cited Times [WOS]:0
|Document Type||Conference paper|
1.Osaka Metropolitan University,Sakai,Japan
2.Osaka Prefecture University,Sakai,Japan
4.Southern University of Science and Technology,Shenzhen,China
Nojima，Yusuke,Fujii，Yuto,Masuyama，Naoki,et al. A Decomposition-based Multi-modal Multi-objective Evolutionary Algorithm with Problem Transformation into Two-objective Subproblems[C],2023:399-402.
|Files in This Item:||There are no files associated with this item.|
|Recommend this item|
|Export to Endnote|
|Export to Excel|
|Export to Csv|
|Similar articles in Google Scholar|
|Similar articles in Baidu Scholar|
|Similar articles in Bing Scholar|
Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.