Penalty and prediction methods for dynamic constrained multi-objective optimization

•Novel penalty and prediction methods based on MOEA named NDCMOEA are proposed.•A new penalty function for constraint handling is introduced.•An IGPM predictor is applied to predict an initial population when a change occurs.•NDCMOEA is very competitive at tracking the changing POS. Dynamic constrai...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Swarm and evolutionary computation Ročník 80; s. 101317
Hlavní autori: Wang, Fengxia, Huang, Min, Yang, Shengxiang, Wang, Xingwei
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 01.07.2023
Predmet:
Dynamic constrained multi-objective optimization problems
Inverse Gaussian process model
Penalty function
Test instances
Test instances
Penalty function
Inverse Gaussian process model
Dynamic constrained multi-objective optimization problems
ISSN:2210-6502
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:•Novel penalty and prediction methods based on MOEA named NDCMOEA are proposed.•A new penalty function for constraint handling is introduced.•An IGPM predictor is applied to predict an initial population when a change occurs.•NDCMOEA is very competitive at tracking the changing POS. 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.
ISSN:2210-6502
DOI:10.1016/j.swevo.2023.101317