Return
An efficient dominance decomposition-based deep graph evolutionary algorithm for the expensive multi-objective optimization
DOI:10.1016/j.eswa.2026.131379.png)
Abstract
En 中文
• Proposes a dominance decomposition-based deep graph evolutionary algorithm. • Decomposes complex dominance prediction into sub-objective superiority learning. • Introduces graph neural networks into expensive multi-objective optimization. • Improves efficiency via multi-task surrogate modeling and cluster filtering. • Demonstrates strong performance on benchmark and real-world optimization tasks.
Keywords:
dominance decomposition
graph neural networks
multi-objective optimization
surrogate modeling
evolutionary algorithm
Journal
IF:
7.5
Papers:
2.9W
Citations:
10.2W

