{"title":"Evolutionary Alternating Direction Method of Multipliers for Constrained Multiobjective Optimization With Unknown Constraints","authors":"Shuang Li;Ke Li;Wei Li;Ming Yang","doi":"10.1109/TEVC.2024.3425629","DOIUrl":null,"url":null,"abstract":"Constrained multiobjective optimization problems (CMOPs) pervade real-world applications in science, engineering, and design. Constraint violation (CV) has been a building block in designing evolutionary multiobjective optimization (EMO) algorithms for solving CMOPs. However, in certain scenarios, constraint functions might be unknown or inadequately defined, making CV unattainable and potentially misleading for the conventional constrained EMO algorithms. To address this issue, we present the first of its kind evolutionary optimization framework, inspired by the principles of the alternating direction method of multipliers that decouples objective and constraint functions. This framework tackles CMOPs with unknown constraints by reformulating the original problem into an additive form of two subproblems, each of which is allotted a dedicated evolutionary population. Notably, these two populations operate toward complementary evolutionary directions during their optimization processes. In order to minimize discrepancy, their evolutionary directions alternate, aiding the discovery of feasible solutions. Comparative experiments conducted against the five state-of-the-art constrained EMO algorithms on 120 benchmark test problem instances with varying properties as well as two real-world engineering optimization problems demonstrate the effectiveness and superiority of our proposed framework. Its salient features include faster convergence and enhanced resilience to various Pareto front shapes.","PeriodicalId":13206,"journal":{"name":"IEEE Transactions on Evolutionary Computation","volume":"29 4","pages":"1419-1433"},"PeriodicalIF":11.7000,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Evolutionary Computation","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10589587/","RegionNum":1,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Constrained multiobjective optimization problems (CMOPs) pervade real-world applications in science, engineering, and design. Constraint violation (CV) has been a building block in designing evolutionary multiobjective optimization (EMO) algorithms for solving CMOPs. However, in certain scenarios, constraint functions might be unknown or inadequately defined, making CV unattainable and potentially misleading for the conventional constrained EMO algorithms. To address this issue, we present the first of its kind evolutionary optimization framework, inspired by the principles of the alternating direction method of multipliers that decouples objective and constraint functions. This framework tackles CMOPs with unknown constraints by reformulating the original problem into an additive form of two subproblems, each of which is allotted a dedicated evolutionary population. Notably, these two populations operate toward complementary evolutionary directions during their optimization processes. In order to minimize discrepancy, their evolutionary directions alternate, aiding the discovery of feasible solutions. Comparative experiments conducted against the five state-of-the-art constrained EMO algorithms on 120 benchmark test problem instances with varying properties as well as two real-world engineering optimization problems demonstrate the effectiveness and superiority of our proposed framework. Its salient features include faster convergence and enhanced resilience to various Pareto front shapes.
期刊介绍:
The IEEE Transactions on Evolutionary Computation is published by the IEEE Computational Intelligence Society on behalf of 13 societies: Circuits and Systems; Computer; Control Systems; Engineering in Medicine and Biology; Industrial Electronics; Industry Applications; Lasers and Electro-Optics; Oceanic Engineering; Power Engineering; Robotics and Automation; Signal Processing; Social Implications of Technology; and Systems, Man, and Cybernetics. The journal publishes original papers in evolutionary computation and related areas such as nature-inspired algorithms, population-based methods, optimization, and hybrid systems. It welcomes both purely theoretical papers and application papers that provide general insights into these areas of computation.