View in EDS

A coevolution algorithm based on two-staged strategy for constrained multi-objective problems.

Saved in:
Bibliographic Details
Title: A coevolution algorithm based on two-staged strategy for constrained multi-objective problems.
Authors: Fan, Chaodong, Wang, Jiawei, Xiao, Leyi, Cheng, Fanyong, Ai, Zhaoyang, Zeng, Zhenhuan
Source: Applied Intelligence; Dec2022, Vol. 52 Issue 15, p17954-17973, 20p
Subject Terms: COEVOLUTION, EVOLUTIONARY algorithms, MATHEMATICAL optimization, ALGORITHMS, CONSTRAINED optimization
Abstract: Constrained Multiobjective Problem (CMOP) is widely used in engineering applications, but the current constrained Multiobjective Optimization algorithms (CMOEA) often fails to effectively balance convergence and diversity. For this purpose, a two-stage co-evolution constrained multi-objective optimization evolutionary algorithm (TSC-CMOEA) is presented to solve constrained multi-objective optimization problems. This method divides the search process into two phases: in the first stage, the synchronous co-evolution is used, and the population corresponding to the help problem and the population corresponding to the raw problem cooperate with each other and share the offspring to produce better solutions, so as to quickly cross the infeasible region and approach the Pareto front; The second stage discards the help problem when it fails and maintains only the evolution of the main population to save computing resources and enhance convergence. The combination of synchronous co-evolution and staged strategy allows the population to traverse infeasible regions more efficiently and converge quickly to feasible and non-dominant regions. The test results on benchmark CMOPs show that the convergence and population distribution of TSC-CMOEA is significantly better than those of NSGA-II, NSGA-III, C-MOEA/D, PPS, ToP and CCMO. [ABSTRACT FROM AUTHOR]
Copyright of Applied Intelligence is the property of Springer Nature and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Description
Abstract:Constrained Multiobjective Problem (CMOP) is widely used in engineering applications, but the current constrained Multiobjective Optimization algorithms (CMOEA) often fails to effectively balance convergence and diversity. For this purpose, a two-stage co-evolution constrained multi-objective optimization evolutionary algorithm (TSC-CMOEA) is presented to solve constrained multi-objective optimization problems. This method divides the search process into two phases: in the first stage, the synchronous co-evolution is used, and the population corresponding to the help problem and the population corresponding to the raw problem cooperate with each other and share the offspring to produce better solutions, so as to quickly cross the infeasible region and approach the Pareto front; The second stage discards the help problem when it fails and maintains only the evolution of the main population to save computing resources and enhance convergence. The combination of synchronous co-evolution and staged strategy allows the population to traverse infeasible regions more efficiently and converge quickly to feasible and non-dominant regions. The test results on benchmark CMOPs show that the convergence and population distribution of TSC-CMOEA is significantly better than those of NSGA-II, NSGA-III, C-MOEA/D, PPS, ToP and CCMO. [ABSTRACT FROM AUTHOR]
ISSN:0924669X
DOI:10.1007/s10489-022-03421-7