返回
A Distribution Information-Based Kriging-Assisted Evolutionary Algorithm for Expensive Many-Objective Optimization Problems
DOI:10.1109/TEVC.2024.3519185.png)
摘要
En 中文
This article proposes a distribution information-based Kriging-assisted evolutionary algorithm (named DISK) to tackle expensive many-objective optimization problems (EMaOPs). In DISK, we design a new Pareto dominance relationship (called DIPD) to guide the evolutionary search and candidate selection. DIPD works based on the Kriging models and incorporates the decision-space distribution information of the nondominated solutions in the database. Such distribution information can be used to assess the possibility of an unknown solution being located in/close to the decision-space promising region. Thanks to this property, DIPD is capable of preserving the predicted elitist solutions located in/close to the decision-space promising region. These solutions are very likely to possess good original Pareto optimality and are beneficial for improving the convergence of the nondominated-solution set in the database. In addition, to further ensure the diversity of the nondominated-solution set in the database, we also design an adaptive exploration strategy, which explores the objective-space unknown region farthest away from the nondominated solutions in the database once the optimization process stagnates. Furthermore, through a feasibility-first mechanism, we extend DISK to deal with constrained EMaOPs, obtaining $\textrm {DISK}^{+}$ . Finally, we verify the competitiveness of DISK and $\textrm {DISK}^{+}$ via extensive experiments.
Keyword:
Distribution information
evolutionary algorithm
expensive many-objective optimization problem
Kriging model
Pareto dominance
期刊
IF:
12
论文数:
1.9K
被引数:
2.4W
机构
引用论文
Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法

