Zhixing Ma

Prof. Dr. Zhixing Ma

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
28 July 2025 in Symmetry
Verified
Journal Article
Open access
PDF file
Hao LiHao Li
Hao Li
JJJianhua Jiang
Jianhua Jiang
ZMZhixing Ma
Zhixing Ma
LLLingna Li
Lingna Li
JLJiayi Liu
Jiayi Liu
ZYZhenhao Yu
Zhenhao Yu
The Tree–Seed Algorithm (TSA) is a symmetry-driven metaheuristic algorithm that shows potential for complex optimization problems, but it suffers from local optimum entrapment and slow convergence. To address these limitations, we propose the ADTSA algorithm. First, ADTSA adopts a symmetry-driven dual-layer framework for seed generation, which promotes effective information exchange between subpopulations and accelerates convergence speed. In later iterations, ADTSA enhances the population’s exploitation ability through a population fusion mechanism, further improving the convergence speed. Moreover, we propose a historical optimal solution archiving and replacement mechanism, along with a t-distribution perturbation mechanism, to enhance the algorithm’s ability to escape local optima. ADTSA also strengthens population diversity and avoids local optima through convex lens symmetric reverse generation based on the optimal solution. With these mechanisms, ADTSA converges more effectively to the global optimum during the evolutionary process. Tests on the IEEE CEC 2014 benchmark functions showed that ADTSA outperformed several top-performing algorithms, such as LSHADE, JADE, LSHADE-RSP, and the latest TSA variants, and it also excelled in comparison with other optimization algorithms, including GWO, PSO, BOA, GA, and RSA, underscoring its robust performance across diverse testing scenarios. The proposed ADTSA’s applicability in solving complex constrained problems was also validated, with the results showing that ADTSA achieved the best solutions for these complex problems.

16 January 2026 in PLOS ONE
Verified
Journal Article
Open access
PDF file
CLChenxi Li
Chenxi Li
JJJianhua Jiang
Jianhua Jiang
ZMZhixing Ma
Zhixing Ma
ZYZhilong Yu
Zhilong Yu
HLHao Li
Hao Li
ZYZhenhao Yu
Zhenhao Yu
The Tree-Seed Algorithm (TSA) is a swarm intelligence algorithm inspired by the propagation relationship between trees and seeds. However, the original TSA is prone to premature convergence and becomes trapped in local optima when addressing high-dimensional, complex optimization problems, limiting its practical efficacy. To overcome these limitations, this paper proposes an Adaptive and Migration-enhanced Tree Seed Algorithm (AMTSA), which integrates three key mechanisms to significantly enhance performance in solving complex optimization tasks. First, to effectively evade local optima, an adaptive tree migration mechanism is designed to dynamically adjust the search step-size and direction based on individual fitness, thereby improving global exploration. Second, to enhance the algorithm’s adaptability and efficiency across different search stages, an adaptive seed generation strategy based on the dynamic Weibull distribution is introduced. This strategy enables flexible control over the number of seeds and promotes a balanced search throughout the solution space. Third, to mitigate convergence oscillations during the global search, a nonlinear step-size adjustment function inspired by the GBO algorithm is incorporated, which effectively improves convergence stability by responding to the iteration progress. Rigorous testing on the IEEE CEC 2014 benchmark functions demonstrates that AMTSA’s overall performance surpasses not only state-of-the-art optimizers like JADE and LSHADE but also recent TSA variants, including STSA, fb-TSA, and MTSA. To further validate its robustness in high-dimensional spaces, AMTSA was tested on 30 benchmark functions at 30, 50, and 100 dimensions. Results show that AMTSA ranked first in the number of functions optimized best and exhibited the fastest convergence speed among all compared algorithms. In a real-world application, AMTSA was employed to optimize multi-threshold segmentation for lung cancer CT images. The resulting AMTSA-SVM classification model achieved an accuracy of 89.5%, significantly outperforming models such as standard SVM (76.22%), DE-SVM (82%), GA-SVM (79.33%), TSA-SVM (84.44%), and JADE-SVM (89.12%). In conclusion, the proposed AMTSA, by integrating adaptive migration, dynamic seed generation, and nonlinear step-size control, successfully addresses the inherent deficiencies of the native TSA, offering a more efficient and robust tool for solving high-dimensional, complex optimization problems. The AMTSA source code will be available at www.jianhuajiang.com .

13 July 2026 in Scientific Reports
Verified
Journal Article
Open access
PDF file
ZMZhixing Ma
Zhixing Ma
ZYZhiheng Yang
Zhiheng Yang
ZGZhipeng Guo
Zhipeng Guo
XMXintao Ma
Xintao Ma
The Besiege and Conquer Algorithm (BCA) is a swarm-based metaheuristic for continuous optimization, but its fixed BCB-controlled search regulation can cause rapid diversity loss and premature convergence on complex landscapes. To address these limitations, this paper proposes a Brownian motion-enhanced Besiege and Conquer Algorithm (BM-BCA). BM-BCA redesigns the search process of BCA through three coordinated mechanisms: a distance-scaled Brownian motion mutation for diversity preservation, a convergence-trend-guided BCB regulation strategy for adaptive exploration–exploitation control, and a hierarchical army–soldier update mechanism for local candidate refinement. The proposed algorithm is evaluated on 29 IEEE CEC-2017 benchmark functions and three constrained engineering design problems, with 30 independent runs conducted for each benchmark function. On the 50-dimensional CEC-2017 suite, BM-BCA obtains the best Friedman mean rank of 2.03 and achieves wins/ties/losses of 24/4/1 against the original BCA and 20/5/4 against LSHADE. In the 100-dimensional setting, BM-BCA remains competitive while requiring an average CPU time of 1.613 s, substantially lower than LSHADE (11.485 s). The ablation study further shows that BM-BCA outperforms the original BCA on 28 out of 29 functions, confirming the effectiveness of the proposed improvement framework. These results demonstrate that BM-BCA improves the search accuracy, convergence stability, and robustness of BCA while preserving the same asymptotic complexity order.