Dezheng Zhang

Dezheng Zhang

Auto-generated profile, based on publicly available information

Dezheng Zhang

School of Electrical and Information Engineering, Zhengzhou University, Zhengzhou, China

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
31 May 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
KQKangjia Qiao
Kangjia Qiao
JLJing Liang
Jing Liang
KYKunjie Yu
Kunjie Yu
CYCaitong Yue
Caitong Yue
HLHongyu Lin
Hongyu Lin
BQBoyang Qu
Boyang Qu
Evolutionary constrained multiobjective optimization has received extensive attention and research in the past two decades, and a lot of benchmarks have been proposed to test the effect of the constrained multiobjective evolutionary algorithms (CMOEAs). Specially, the constraint functions are highly correlated with the objective values, which makes the features of constraints too monotonic and differ from the properties of the real-world problems. Accordingly, previous CMOEAs cannot solve real-world problems well, which generally involve decision space constraints with multi-modal/non-linear features. Therefore, we propose a new benchmark framework and design a suite of new test functions with scalable high-dimensional decision space constraints. To be specific, different high-dimensional constraint functions and mixed linkages in variables are considered to be close to realistic features. In this framework, several parameter interfaces are provided, so that users can easily adjust the parameters to obtain the variant functions and test the generalization performance of the algorithms. Different types of existing CMOEAs are employed to test the use of the proposed test functions, and the results show that they are easy to fall into local feasible regions. Therefore, we improve one evolutionary multitasking-based CMOEA to better handle these problems, in which a new search algorithm is designed to enhance the search abilities of populations. Compared with the existing CMOEAs, the proposed CMOEA presents better performance.

22 July 2022 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
KYKunjie Yu
Kunjie Yu
DZDezheng Zhang
Dezheng Zhang
JLJing Liang
Jing Liang
KCKe Chen
Ke Chen
CYCaitong Yue
Caitong Yue
LWLing Wang
Ling Wang
When solving dynamic multiobjective optimization problems by evolutionary algorithms, the historical moving directions of some special points along the Pareto front, such as the center and knee points, are widely employed to predict the Pareto-optimal solutions (POS). However, special points may be impacted by certain individuals with a large direction deviation, and thus mislead the tracking of dynamic POS. To solve this issue, a correlation-guided layered prediction approach for solving dynamic multiobjective optimization problems is proposed in this paper, where multiple prediction models are integrated by considering the correlation of individuals’ moving directions. To be specific, the population is clustered into three subpopulations (i.e., high, mid, and low correlation) by correlation analysis to perform different prediction behaviors. The high correlation subpopulation aims to predict the moving direction via a linear prediction model. The mid correlation subpopulation is devoted to predicting the manifold change of POS by self-adaptively using the direction and length correction models. The diversity preservation is considered by the low correlation subpopulation. While the three subpopulations focus on different optimization tasks, they also cooperate to track the dynamic POS. The comprehensive experimental results on a variety of benchmark test problems demonstrate the superiority of the proposed approach, as compared with some state-of-the-art prediction-based dynamic multiobjective algorithms.

28 June 2023 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
KYKunjie Yu
Kunjie Yu
DZDezheng Zhang
Dezheng Zhang
JLJing Liang
Jing Liang
BQBoyang Qu
Boyang Qu
MLMengnan Liu
Mengnan Liu
LWLing Wang
Ling Wang
Dynamic multiobjective optimization problems (DMOPs) are widely encountered in real-world applications and have received considerable attention in recent years. During the process of solving DMOPs, tracking the constantly changing Pareto optimal set (POS) quickly is the main task, and numerous methods have been proposed to achieve this task from different perspectives. However, how to improve the evolution of static optimizers via using historical information from past environments gets little attention. In fact, with adequate historical evolution information to learn, the trend of population evolution in the historical environments is promising to guide the future evolution and thus enhance the search ability. Therefore, in this paper, a historical evolution learning based framework is proposed to assist the static optimizers in fully using the historical evolution direction and POSs distribution. Specifically, two new models are designed with a purpose of generating offsprings and environmental selection, respectively. For enhancing the contribution of offsprings, a direction guidance model is developed to guide the offsprings according to the direction tendency of historical evolution. Furthermore, to improve the robustness of static optimizers and avoid the disturbance caused by misleading solutions, a manifold revise model is proposed to produce promising solutions via consulting historical POSs distribution. The proposed framework employs these two models collaboratively, and it is flexible and readily to be embedded into various dynamic response mechanisms and static optimizers in coping with DMOPs. The superiority of the framework has been comprehensively demonstrated by experimental comparison results on a variety of benchmark test problems.

9 July 2024 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
DZDezheng Zhang
Dezheng Zhang
KYKunjie Yu
Kunjie Yu
JLJing Liang
Jing Liang
KQKangjia Qiao
Kangjia Qiao
BQBoyang Qu
Boyang Qu
LWLing Wang
Ling Wang
Dynamic constrained multiobjective optimization problems (DCMOPs) are widely encountered in real-world applications and have attracted increasing attention in the evolutionary computation community. Existing studies primarily focus on the population initialization, but disregard to improve the evolution process. In DCMOPs, the knowledge is undoubtedly more abundant as the existence of historical environments. Therefore, extracting and utilizing useful knowledge from historical environments can further improve the evolution process. In this paper, a history-assisted two-state auxiliary task collaboration approach is proposed to solve DCMOPs by conducting a more effective auxiliary task. Specifically, the algorithm indicates that constrained Pareto-optimal front (CPF) in similar historical environments is more suitable as an auxiliary task for current evolution, as it is closer to the current CPF. To identify the most suitable environment from extensive historical environments, a novel prediction-based similar environment identification method is proposed for the auxiliary task. To fully utilize the novel auxiliary task, an experience-driven two-state environmental selection strategy is proposed, which conditionally considers both historical and current information. In this strategy, individuals in state A are inclined to promote towards the historical CPF while disregarding the dominance relationship or constraints, to help cross infeasible region and approach CPF rapidly. For those individuals in state B, dominance relationship is taken into consideration, further bringing auxiliary task closer to the main task. The superiority of the proposed algorithm has been comprehensively demonstrated by experimental comparison results on a variety of benchmark test problems and a real-world problem with raw ore allocation in mineral processing.

14 May 2025 in Swarm and Evolutionary Computation
Verified
Journal Article
Closed access
LYLi Yan
Li Yan
YWYinjin Wu
Yinjin Wu
YLYaxin Li
Yaxin Li
BQBoyang Qu
Boyang Qu
JLJing Liang
Jing Liang
DZDezheng Zhang
Dezheng Zhang

12 May 2025 in IEEE Transactions on Evolutionary Computation
Verified
Journal Article
Closed access
DZDezheng Zhang
Dezheng Zhang
KZKai Zhang
Kai Zhang
KYKunjie Yu
Kunjie Yu
JLJing Liang
Jing Liang
KQKangjia Qiao
Kangjia Qiao
CYCaitong Yue
Caitong Yue
Dynamic constrained multiobjective optimization problems (DCMOPs) are widely existed in real-world applications and emerged as a prominent research focus in the evolutionary computation community. Current studies on DCMOPs face two main challenges: limited accuracy in population prediction, and a lack of effective strategies to improve static optimizer performance. To tackle these challenges, this paper proposes a dynamic constrained multiobjective evolutionary algorithm based on multipopulation prediction and dynamic fusion ranking. Specifically, an efficient computer-vision-inspired point set registration method, named coherent point drift, is introduced to align individuals across successive environments. With the correspondences between two environments, the solution trajectory tracking problem is transformed as a point set registration problem. Based on the observed trajectory of solutions, the Pareto-optimal set or Pareto-optimal front in the new environment can be predicted. Additionally, this paper highlights the importance of task-specific multipopulation prediction. After analysis the specific tasks of each population, different initial populations tailored to the tasks are predicted by the proposed prediction method. Finally, a dynamic fusion based two-ranking environmental selection strategy is proposed for the auxiliary task. This strategy dynamically integrates experience-based and constraint-based approaches, improving the auxiliary population evolutionary efficiency and its alignment with the main task. The superiority of proposed algorithm is validated through extensive experiments on a series of benchmark problems and a real-world raw ore allocation problem.