Journal Article10.4018/ijcini.355766
An Improved Coevolutionary Algorithm for Constrained Multi-Objective Optimization Problems
Shumin Xie,Zhenjia Zhu,Hui Wang +2 more
TL;DR: This paper proposes iCMOCA, an improved coevolutionary algorithm for constrained multi-objective optimization problems, utilizing two populations and effective collaboration to outperform five state-of-the-art algorithms on DAS-CMOP and MW test suites.
read more
Abstract: Constrained multi-objective optimization problems are ubiquitous in engineering applications. In recent years, constrained multi-objective optimization algorithms based on the dual population coevolutionary framework have been widely studied due to their excellent performance. However, when facing optimization problems with complex constraints, the performance of existing algorithms still needs further improvement. This paper proposes an improved constrained multi-objective coevolutionary algorithm (iCMOCA). The algorithm mainly includes two populations: One population takes into account constraints, while the other population disregards them. Meanwhile, the iCMOCA employs effective collaboration between two populations during the process of offspring generation and environmental selection, and it utilizes an environmental selection strategy based on multi-objective to multi-objective decomposition to improve the performance. Comparative analysis conducted on the DAS-CMOP and MW test suites provides empirical evidence that iCMOCA outperforms five state-of-the-art algorithms.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
A fast and elitist multiobjective genetic algorithm: NSGA-II
TL;DR: This paper suggests a non-dominated sorting-based MOEA, called NSGA-II (Non-dominated Sorting Genetic Algorithm II), which alleviates all of the above three difficulties, and modify the definition of dominance in order to solve constrained multi-objective problems efficiently.
MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition
Qingfu Zhang,Hui Li +1 more
TL;DR: Experimental results have demonstrated that MOEA/D with simple decomposition methods outperforms or performs similarly to MOGLS and NSGA-II on multiobjective 0-1 knapsack problems and continuous multiobjectives optimization problems.
SPEA2: Improving the strength pareto evolutionary algorithm
Eckart Zitzler,Marco Laumanns,Lothar Thiele +2 more
- 01 Jan 2001
TL;DR: An improved version of SPEA, namely SPEA2, is proposed, which incorporates in contrast to its predecessor a fine-grained fitness assignment strategy, a density estimation technique, and an enhanced archive truncation method.
6K
A practical tutorial on the use of nonparametric statistical tests as a methodology for comparing evolutionary and swarm intelligence algorithms
TL;DR: The basics are discussed and a survey of a complete set of nonparametric procedures developed to perform both pairwise and multiple comparisons, for multi-problem analysis are given.
4.9K
An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point Based Nondominated Sorting Approach, Part II: Handling Constraints and Extending to an Adaptive Approach
Himanshu Jain,Kalyanmoy Deb +1 more
TL;DR: This paper extends NSGA-III to solve generic constrained many-objective optimization problems and suggests three types of constrained test problems that are scalable to any number of objectives and provide different types of challenges to a many- objective optimizer.