Journal Article10.1109/jas.2023.123495
A Line Complex-Based Evolutionary Algorithm for Many-Objective Optimization
11
TL;DR: Zhang et al. as discussed by the authors proposed to evolve solutions through line complex rather than solution points in Euclidean space, where Plücker coordinates are used to project solution points to line complex composed of position vectors and momentum vectors.
read more
Abstract: 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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Optimal layout planning for Human robot collaborative assembly systems and visualization through immersive technologies
Eswaran M,Anil kumar Inkulu,Kaartick Tamilarasan,M.V.A. Raju Bahubalendruni,Jaideep R. Muhammad Selmanul Faris,Nidhin Jacob +5 more
TL;DR: This study proposes an AR-assisted layout planning framework for Human-Robot Collaboration (HRC) systems, utilizing multi-objective optimization and immersive technologies to maximize production, reduce idle time, and optimize resource allocation in smart manufacturing systems.
27
Evolutionary Optimization Methods for High-Dimensional Expensive Problems: A Survey
Mengchu Zhou,Meiji Cui,Dian Xu,Shuwei Zhu,Ziyan Zhao,Abdullah Abusorrah +5 more
TL;DR: A comprehensive survey of surrogate-assisted evolutionary algorithms for HEPs from four main aspects and indicates open challenges and several promising directions to advance the progress in evolutionary optimization algorithms for HEPs.
19
Dynamic Adaptive Multi-objective Optimization Algorithm based on Type Detection
Xingjuan Cai,Lin-Liang Bill Wu,Tianhao Zhao,Di Wu,Wensheng Zhang,Jinjun Chen +5 more
TL;DR: This paper proposes TDA-DMOEA, an adaptive dynamic multi-objective evolutionary algorithm for type detection, which identifies dynamic problem types using Wilcoxon signed-rank test and Hyper Volume, and responds with tailored strategies to optimize dynamic multi-objective problems.
11
A grey prediction evolutionary algorithm with a surrogate model based on quadratic interpolation
Wen Li,Qinghua Su,Zhongbo Hu +2 more
TL;DR: This paper introduces GPE-QI, an improved grey prediction evolutionary algorithm using a quadratic surrogate model to mine local evolutionary trends, enhancing prediction direction and outperforming established algorithms on CEC2019, CEC2020, and engineering design problems.
5
A self-driving solution for resource-constrained autonomous vehicles in parked areas
Jin Qian,Liang Zhang,Qiwei Huang,Xinyi Liu,Xiaoshuang Xing,Xuehan Li +5 more
TL;DR: This paper proposes an efficient autonomous driving solution for resource-constrained autonomous vehicles in industrial parks, incorporating path planning, target recognition, and driving decision-making, and demonstrates its effectiveness through performance analysis and experimental validation.
3
References
A global geometric framework for nonlinear dimensionality reduction.
TL;DR: An approach to solving dimensionality reduction problems that uses easily measured local metric information to learn the underlying global geometry of a data set and efficiently computes a globally optimal solution, and is guaranteed to converge asymptotically to the true structure.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints
Kalyanmoy Deb,Himanshu Jain +1 more
TL;DR: A reference-point-based many-objective evolutionary algorithm that emphasizes population members that are nondominated, yet close to a set of supplied reference points is suggested that is found to produce satisfactory results on all problems considered in this paper.
Kernel Principal Component Analysis
Bernhard Schölkopf,Alexander J. Smola,Klaus-Robert Müller +2 more
- 08 Oct 1997
TL;DR: A new method for performing a nonlinear form of Principal Component Analysis by the use of integral operator kernel functions is proposed and experimental results on polynomial feature extraction for pattern recognition are presented.
2.6K
When Is ''Nearest Neighbor'' Meaningful?
Kevin S. Beyer,Jonathan Goldstein,Raghu Ramakrishnan,Uri Shaft +3 more
- 10 Jan 1999
TL;DR: The effect of dimensionality on the "nearest neighbor" problem is explored, and it is shown that under a broad set of conditions, as dimensionality increases, the Distance to the nearest data point approaches the distance to the farthest data point.