Changzu Chen

Dr. Changzu Chen

orcid

Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
12 November 2025 in Biomimetics
Verified
Journal Article
Open access
PDF file
BCBinhe Chen
Binhe Chen
YCYaodan Chen
Yaodan Chen
LCLi Cao
Li Cao
CCChangzu Chen
Changzu Chen
YYYinggao Yue
Yinggao Yue
The Crested Porcupine Optimizer (CPO), as a newly emerging swarm intelligence algorithm, demonstrates advantages in balancing global exploration and local exploitation but still suffers from limitations in convergence speed and local exploitation precision. To address these issues, this paper proposes an enhanced variant, the Butterfly Search and Triangular Walk Crested Porcupine Optimizer (BTCPO). The method achieves a dynamic balance between exploration and exploitation by combining triangular walk to boost local exploitation and butterfly search to increase global variety. Experimental results on 23 classical benchmark functions and the CEC2021 test suite show that BTCPO outperforms CPO as well as seven state-of-the-art algorithms (DBO, HBA, BKA, HHO, GWO, GOOSE, and SSA). Specifically, BTCPO achieves the best performance on more than 80% of CEC2021 functions, with convergence speed improved by approximately 25% compared to CPO. Furthermore, BTCPO exhibits higher efficiency and usefulness in engineering design problems such as trusses, welded beams, and cantilever beams. These findings demonstrate the theoretical and practical advantages of BTCPO, making it a workable approach to solving difficult optimization problems.

9 October 2025 in Biomimetics
Verified
Journal Article
Open access
PDF file
CCChangzu Chen
Changzu Chen
LCLi Cao
Li Cao
BCBinhe Chen
Binhe Chen
YCYaodan Chen
Yaodan Chen
XWXinxue Wu
Xinxue Wu
The secretary bird optimization algorithm is a recently developed swarm intelligence method with potential for solving nonlinear and complex optimization problems. However, its performance is constrained by limited global exploration and insufficient local exploitation. To address these issues, an enhanced variant, ORSBOA, is proposed by integrating an optimal neighborhood perturbation mechanism with a reverse learning strategy. The algorithm is evaluated on the CEC2019 and CEC2022 benchmark suites as well as four classical engineering design problems. Experimental results demonstrate that ORSBOA achieves faster convergence, stronger robustness, and higher solution quality than nine state-of-the-art algorithms. Statistical analyses further confirm the significance of these improvements, validating the effectiveness and applicability of ORSBOA in solving complex optimization tasks.