.png){kind=icon}
返回
Penalty and prediction methods for dynamic constrained multi-objective optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.swevo.2023.101317.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Dynamic constrained multi-objective optimization problems (DCMOPs) involve objective functions and constraints that vary over time, requiring optimization algorithms to track the changing Pareto optimal set (POS) quickly. This paper proposes a new dynamic constrained multi-objective evolutionary algorithm (NDCMOEA) to address this issue. Specifically, the constraint handling strategy based on a novel penalty function integrates the constraint deviation values in the objective space and the similarity deviation values in the decision space. This method promotes selecting promising infeasible solutions closer to the POS and drives the population towards the Pareto optimal front (POF). When environmental changes occur, we employ a dynamic response strategy based on random initialization and an inverse Gaussian process model (IGPM) predictor considering the information of feasible region changes. Then, the IGPM predictor uses the sampled points generated by the Latin hypercube sampling (LHS) mechanism in the preferred regions of the objective space to obtain the initial population with better convergence and diversity in the new environment. The proposed algorithm is validated on a set of test instances and a real-world fluid catalytic cracking-distillation process optimization problem. The experimental results indicate that NDCMOEA is very competitive in dealing with DCMOPs compared with several state-of-the-art algorithms.
Keyword:
Dynamic constrained multi -objective optimi
zation problems
Penalty function
Inverse Gaussian process model
Test instances
期刊
IF:
8.5
论文数:
2.2K
被引数:
1.0W
机构
引用论文
分享收藏Multiobjective evolutionary algorithms: A comparative case study and the Strength Pareto approach多目标进化算法: 比较案例研究和强度帕累托方法
PREAI
分享收藏A prediction strategy based on decision variable analysis for dynamic Multi-objective Optimization
OAAI
OAAI分享收藏Duality evolution: an efficient approach to constraint handling in multi-objective particle swarm optimization.png)
SOFT COMPUTING
SOFT COMPUTINGIF2.5
PREAI
分享收藏
查看更多内容