A Line Complex-Based Evolutionary Algorithm for Many-Objective Optimization

In solving many-objective optimization problems (MaOPs), existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure. Most candidate solutions become nondominated during the evolutionary process, thus leading to the failure of producing...

Full description

Saved in:
Bibliographic Details
Published in:IEEE/CAA journal of automatica sinica 2023-05, Vol.10 (5), p.1150-1167
Main Authors: Zhang, Liang, Kang, Qi, Deng, Qi, Xu, Luyuan, Wu, Qidi
Format: Article
Language:English
Subjects:
Benchmark testing
Convergence
Environmental selection
Euclidean distance
Euclidean geometry
Euclidean space
Evolutionary algorithms
Evolutionary computation
Genetic algorithms
line complex
many-objective optimization problems (MaOPs)
Momentum
Multiple objective analysis
Optimization
Plücker coordinate
Reinforcement learning
Sorting algorithms
Transfer learning
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In solving many-objective optimization problems (MaOPs), existing nondominated sorting-based multi-objective evolutionary algorithms suffer from the fast loss of selection pressure. Most candidate solutions become nondominated during the evolutionary process, thus leading to the failure of producing off-spring toward Pareto-optimal front with diversity. Can we find a more effective way to select nondominated solutions and resolve this issue? To answer this critical question, this work proposes to evolve solutions through line complex rather than solution points in Euclidean space. First, Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum ones. Besides position vectors of the solution points, momentum vectors are used to extend the comparability of non-dominated solutions and enhance selection pressure. Then, a new distance function designed for high-dimensional space is proposed to replace Euclidean distance as a more effective distance-based estimator. Based on them, a novel many-objective evolutionary algorithm (MaOEA) is proposed by integrating a line complex-based environmental selection strategy into the NSGA-III framework. The proposed algorithm is compared with the state of the art on widely used benchmark problems with up to 15 objectives. Experimental results demonstrate its superior competitiveness in solving MaOPs.
ISSN:2329-9266
2329-9274
DOI:10.1109/JAS.2023.123495