Hao Li

Dr. Hao Li

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.

15 October 2025 in Electronics
Verified
Journal Article
Open access
PDF file
JJJianhua Jiang
Jianhua Jiang
XXXiangyu Xin
Xiangyu Xin
JTjun tian
jun tian
Hao LiHao Li
Hao Li
Besiege and Conquer Algorithm (BCA) is a swarm intelligence algorithm proposed in 2025 based on tactical concepts. However, its besiege and conquer strategies have some problems, such as insufficient diversity and local stagnation. To solve the above problems, this paper proposes an Enhanced Besiege and Conquer Algorithm with Three-Three Tactics and Collision Theory, referred to as TTBCA+. TTBCA+ has four innovations. Firstly, a three-three allocation mechanism of battlefield and roles is proposed to enhance its besiege capability; secondly, a three-three deployment mechanism of soldiers is proposed to enhance its conquer capability; thirdly, the balance factor between exploration and exploitation is modified for three-three tactics implementation; finally, the collision mechanism from collision theory is introduced to deal with soldiers beyond the search space. The performance of the proposed TTBCA+ is verified at the IEEE CEC 2017 and IEEE CEC 2022 benchmark functions, compared with 13 swarm intelligence algorithms, including classical algorithms, well-known algorithms such as JADE, lshade_rsp, AGWO, and recent 5 years algorithms, such as BCA, HOA, PLO, CFOA, HLOA, DBO, BOA. Meanwhile, the proposed algorithms are applied to two practical complex optimization problems. The results show that TTBCA+ effectively solved the limitations in BCA, and it is superior to other compared algorithms.