Xi Yang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xi Yang has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Jianhua Jiang
Jilin University of Finance and Economics
3 shared publications - Jiaqi Wu
Center for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China
2 shared publications - Jinmeng Luo
Center for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China
2 shared publications - Jiansheng Huang
Center for Artificial Intelligence, Jilin University of Finance and Economics, Changchun 130117, China
1 shared publication - Lan Cheng
State Grid Hubei Electric Power Co., Ltd.,Wuhan Power Supply Company,Wuhan,China
1 shared publication Mengjuan Li
1 shared publication
Latest Publications
- Open Access
DTSA: Dynamic Tree-Seed Algorithm with Velocity-Driven Seed Generation and Count-Based Adaptive Strategies
The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA’s capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm’s ability to explore and exploit solution spaces. Moreover, DTSA’s adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm’s efficiency and stability in handling complex optimization issues, and DTSA’s robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations.
Open AccessDTSA: Dynamic Tree-Seed Algorithm with Velocity-Driven Seed Generation and Count-Based Adaptive Strategies
The Tree-Seed Algorithm (TSA) has been effective in addressing a multitude of optimization issues. However, it has faced challenges with early convergence and difficulties in managing high-dimensional, intricate optimization problems. To tackle these shortcomings, this paper introduces a TSA variant (DTSA). DTSA incorporates a suite of methodological enhancements that significantly bolster TSA’s capabilities. It introduces the PSO-inspired seed generation mechanism, which draws inspiration from Particle Swarm Optimization (PSO) to integrate velocity vectors, thereby enhancing the algorithm’s ability to explore and exploit solution spaces. Moreover, DTSA’s adaptive velocity adaptation mechanism based on count parameters employs a counter to dynamically adjust these velocity vectors, effectively curbing the risk of premature convergence and strategically reversing vectors to evade local optima. DTSA also integrates the trees population integrated evolutionary strategy, which leverages arithmetic crossover and natural selection to bolster population diversity, accelerate convergence, and improve solution accuracy. Through experimental validation on the IEEE CEC 2014 benchmark functions, DTSA has demonstrated its enhanced performance, outperforming recent TSA variants like STSA, EST-TSA, fb-TSA, and MTSA, as well as established benchmark algorithms such as GWO, PSO, BOA, GA, and RSA. In addition, the study analyzed the best value, mean, and standard deviation to demonstrate the algorithm’s efficiency and stability in handling complex optimization issues, and DTSA’s robustness and efficiency are proven through its successful application in five complex, constrained engineering scenarios, demonstrating its superiority over the traditional TSA by dynamically optimizing solutions and overcoming inherent limitations.
- Top Cited PapersOpen Access
- 24 May 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (6) , 316
MOBCA: Multi-Objective Besiege and Conquer Algorithm
The besiege and conquer algorithm has shown excellent performance in single-objective optimization problems. However, there is no literature on the research of the BCA algorithm on multi-objective optimization problems. Therefore, this paper proposes a new multi-objective besiege and conquer algorithm to solve multi-objective optimization problems. The grid mechanism, archiving mechanism, and leader selection mechanism are integrated into the BCA to estimate the Pareto optimal solution and approach the Pareto optimal frontier. The proposed algorithm is tested with MOPSO, MOEA/D, and NSGAIII on the benchmark function IMOP and ZDT. The experiment results show that the proposed algorithm can obtain competitive results in terms of the accuracy of the Pareto optimal solution.
- 24 May 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (6) , 316
Top Cited PapersOpen AccessMOBCA: Multi-Objective Besiege and Conquer Algorithm
The besiege and conquer algorithm has shown excellent performance in single-objective optimization problems. However, there is no literature on the research of the BCA algorithm on multi-objective optimization problems. Therefore, this paper proposes a new multi-objective besiege and conquer algorithm to solve multi-objective optimization problems. The grid mechanism, archiving mechanism, and leader selection mechanism are integrated into the BCA to estimate the Pareto optimal solution and approach the Pareto optimal frontier. The proposed algorithm is tested with MOPSO, MOEA/D, and NSGAIII on the benchmark function IMOP and ZDT. The experiment results show that the proposed algorithm can obtain competitive results in terms of the accuracy of the Pareto optimal solution.
- 9 September 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 279
ATSA: An Adaptive Tree Seed Algorithm based on double-layer framework with tree migration and seed intelligent generation
- 9 September 2023
- Published by Elsevier in Knowledge-Based Systems
- Vol. 279
ATSA: An Adaptive Tree Seed Algorithm based on double-layer framework with tree migration and seed intelligent generation
- 13 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 28, 1-8
Substation Telecontrol Fast Stable Point-to-Point System Based on Naive Bayesian Algorithm
In order to better guarantee the operation effect of substation, a substation telecontrol fast point-to-point system based on Naive Bayesian algorithm is designed. The hardware structure configuration of the system is designed, the system software function is improved, and the fast point-to-point steps of substation telecontrol are simplified. And the experiment proves that the performance of the substation telecontrol fast point-to-point system based on Naive Bayesian algorithm is significantly improved, which can better ensure the operation safety of the substation.
- 13 October 2022
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 28, 1-8
Substation Telecontrol Fast Stable Point-to-Point System Based on Naive Bayesian Algorithm
In order to better guarantee the operation effect of substation, a substation telecontrol fast point-to-point system based on Naive Bayesian algorithm is designed. The hardware structure configuration of the system is designed, the system software function is improved, and the fast point-to-point steps of substation telecontrol are simplified. And the experiment proves that the performance of the substation telecontrol fast point-to-point system based on Naive Bayesian algorithm is significantly improved, which can better ensure the operation safety of the substation.