arrow
Return

Adaptive Constraint-Boundary Learning-Based Two-Stage Dual-Population Evolutionary Algorithm

delete2025-10-06
delete0
delete
OA
AI
X
Xiu, Xinran
Y
Yu Fu
H
Hongzhou Wang
Y
Yiming Song *
DOI:10.3390/math13193206delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
In recent years, numerous constrained multi-objective evolutionary algorithms (CMOEAs) have been proposed to tackle constrained multi-objective optimization problems (CMOPs). However, most of them still struggle to achieve a good balance among convergence, diversity, and feasibility. To address this issue, we develop an adaptive constraint-boundary learning-based two-stage dual-population evolutionary algorithm for CMOPs, referred to as CL-TDEA. The evolutionary process of CL-TDEA is divided into two stages. In the first stage, two populations cooperate weakly through environmental selection to enhance the exploration ability of CL-TDEA under constraints. In particular, the auxiliary population employs an adaptive constraint-boundary learning mechanism to learn the constraint boundary, which in turn enables the main population to more effectively explore the constrained search space and cross infeasible regions. In the second stage, the cooperation between the two populations drives the search toward the complete constrained Pareto front (CPF) through mating selection. Here, the auxiliary population provides additional guidance to the main population, helping it escape locally feasible but suboptimal regions by means of the proposed cascaded multi-criteria hierarchical ranking strategy. Extensive experiments on 54 test problems from four benchmark suites and three real-world applications demonstrate that the proposed CL-TDEA exhibits superior performance and stronger competitiveness compared with several state-of-the-art methods.
Keywords:
evolutionary algorithm
constraint boundary learning
two-stage
dual-population
cascading multi-criteria hierarchical ranking
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Mathematics cover
Mathematics
IF:
2.2
Papers:
3.1K
Citations:
3.6W

Organization

B
Beijing Normal University
Scholars:
3.3W
Papers: 2.7W
Citations: 4.2W
T
tsinghua university
Scholars:
11.9W
Papers: 10.0W
Citations: 137
X
Xidian University
Scholars:
2.4W
Papers: 1.9W
Citations: 9.7K
researcher View more organizations
Cited Papers

Cited Papers

errShare
errSave
An archive-based two-stage evolutionary algorithm for constrained multi-objective optimization problems
err2022-12-01
err23
PREAI
errBao, Qian; Wang, Maocai; Dai, Guangming; Chen, Xiaoyu; Song, Zhiming; Li, Shuijia
errShare
errSave
A constrained multi-objective optimization algorithm using an efficient global diversity strategy
err2022-09-14
err10
errOAAI
errLong, Wenyi; Dong, Huachao; Wang, Peng; Huang, Yan; Li, Jinglu; Yang, Xubo; Fu, Chongbo
errShare
errSave
Push and pull search for solving constrained multi-objective optimization problems
err2019-02-01
err342
errOAAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Li, Hui; Wei, Caimin; Zhang, Qingfu; Deb, Kalyanmoy; Goodman, Erik
errShare
errSave
A test-suite of non-convex constrained optimization problems from the real-world and some baseline results
err2020-08-01
err329
PREAI
errKumar, Abhishek; Wu, Guohua; Ali, Mostafa Z.; Mallipeddi, Rammohan; Suganthan, Ponnuthurai Nagaratnam; Das, Swagatam
errShare
errSave
An improved epsilon constraint-handling method in MOEA/D for CMOPs with large infeasible regions
err2019-02-04
err238
PREAI
errFan, Zhun; Li, Wenji; Cai, Xinye; Huang, Han; Fang, Yi; You, Yugen; Mo, Jiajie; Wei, Caimin; Goodman, Erik
errShare
errSave
researcher View more