Dynamic Constrained Multi-Objective Evolutionary Optimization via Adaptive Two-Stage Archiving and Autoencoder Prediction

Dynamic constrained multi-objective optimization problems (DCMOPs) are characterized by time-varying objectives and constraints, requiring optimization algorithms that can rapidly track the changing Pareto-Optimal Set (POS).A new dynamic constrained multi-objective evolutionary algorithm with adapti...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2023 5th International Conference on Data-driven Optimization of Complex Systems (DOCS) s. 1 - 8
Hlavní autoři: Wang, Qianhui, Ye, Yulong, Zhu, Qingling, Liu, Songbai, Lin, Qiuzhen
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 22.09.2023
Témata:
Constraint handling
Constraint-handling techniques
Denoising autoencoder
Dynamic constrained multiobjective optimization
Evolutionary computation
Heuristic algorithms
Noise reduction
Prediction algorithms
Sociology
Transfer learning
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Dynamic constrained multi-objective optimization problems (DCMOPs) are characterized by time-varying objectives and constraints, requiring optimization algorithms that can rapidly track the changing Pareto-Optimal Set (POS).A new dynamic constrained multi-objective evolutionary algorithm with adaptive two-stage archiving and autoencoder prediction is proposed in this paper, called ATAP to effectively solve DCMOPs. Specifically, ATAP designs a differential denoising autoencoder (DDA) prediction strategy, which applies a denoising autoencoder to thoroughly analyze change trends of historical population and predict some initial solutions in the new environment. Subsequently, to promote greater diversity within the initial population, a differential rule is implemented, effectively addressing the potential scarcity of diversity caused by constraints. Moreover, ATAP introduces an adaptive two-stage archiving (ATA) constraint handling technique, which can dynamically adjust evolutionary stages based on the state of the population. This approach can adaptively determine preferences between objectives and constraints, achieving a better balance. In this way, ATA and DDA are well cooperated to efficiently solve DCMOPs with time-varying constraints and objectives. The experimental results demonstrate that the proposed ATAP is effective and has some advantages over three competitive algorithms when solving the CEC2023 DCMOP benchmark.
DOI:10.1109/DOCS60977.2023.10294439