WeChat Mini Program
Old Version Features

Evolutionary Alternating Direction Method of Multipliers for Constrained Multi-Objective Optimization with Unknown Constraints

IEEE Transactions on Evolutionary Computation(2024)CCF BSCI 1区

Harbin Institute of Technology Control and Simulation Center

Cited 0|Views39
Abstract
Constrained multi-objective optimization problems (CMOPs) pervade real-worldapplications in science, engineering, and design. Constraint violation has beena building block in designing evolutionary multi-objective optimizationalgorithms for solving constrained multi-objective optimization problems.However, in certain scenarios, constraint functions might be unknown orinadequately defined, making constraint violation unattainable and potentiallymisleading for conventional constrained evolutionary multi-objectiveoptimization algorithms. To address this issue, we present the first of itskind evolutionary optimization framework, inspired by the principles of thealternating direction method of multipliers that decouples objective andconstraint functions. This framework tackles CMOPs with unknown constraints byreformulating the original problem into an additive form of two subproblems,each of which is allotted a dedicated evolutionary population. Notably, thesetwo populations operate towards complementary evolutionary directions duringtheir optimization processes. In order to minimize discrepancy, theirevolutionary directions alternate, aiding the discovery of feasible solutions.Comparative experiments conducted against five state-of-the-art constrainedevolutionary multi-objective optimization algorithms, on 120 benchmark testproblem instances with varying properties, as well as two real-worldengineering optimization problems, demonstrate the effectiveness andsuperiority of our proposed framework. Its salient features include fasterconvergence and enhanced resilience to various Pareto front shapes.
More
Translated text
Key words
Multi-objective optimization,constraint handling,alternating direction method of multipliers,evolutionary algorithm
PDF
Bibtex
AI Read Science
Must-Reading Tree
Example
Generate MRT to find the research sequence of this paper
Data Disclaimer
The page data are from open Internet sources, cooperative publishers and automatic analysis results through AI technology. We do not make any commitments and guarantees for the validity, accuracy, correctness, reliability, completeness and timeliness of the page data. If you have any questions, please contact us by email: report@aminer.cn
Chat Paper

要点】:本文提出了一种新颖的进化交替方向乘数法框架,用于解决具有未知约束的约束多目标优化问题,该框架通过交替两个子问题的进化方向以发现可行解,展现出较现有算法更快的收敛速度和更好的对各种Pareto前沿形状的鲁棒性。

方法】:该框架基于交替方向乘数法的原理,将目标函数和约束函数解耦,通过将原问题重新表述为两个子问题的和的形式,每个子问题分配有一个进化的种群。

实验】:通过与五种最先进的约束进化多目标优化算法比较,在120个具有不同特性的基准测试问题实例上,以及两个实际工程优化问题上,证明了所提框架的有效性和优越性,其突出特点包括快速收敛和增强的对各种Pareto前沿形状的鲁棒性。