Yaning Xiao

Dr. Yaning Xiao

Northeast Forestry University, Harbin, Heilongjiang, China
orcid

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
6 January 2025 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
YXYaning Xiao
Yaning Xiao
HCHao Cui
Hao Cui
RKRuba Abd almajeed Abu Khurma
Ruba Abd almajeed Abu Khurma
Pedro A. Castillo-ValdiviesoPedro A. Castillo-Valdivieso
Pedro A. Castillo-Valdivieso
The advent of the intelligent information era has witnessed a proliferation of complex optimization problems across various disciplines. Although existing meta-heuristic algorithms have demonstrated efficacy in many scenarios, they still struggle with certain challenges such as premature convergence, insufficient exploration, and lack of robustness in high-dimensional, nonconvex search spaces. These limitations underscore the need for novel optimization techniques that can better balance exploration and exploitation while maintaining computational efficiency. In response to this need, we propose the Artificial Lemming Algorithm (ALA), a bio-inspired metaheuristic that mathematically models four distinct behaviors of lemmings in nature: long-distance migration, digging holes, foraging, and evading predators. Specifically, the long-distance migration and burrow digging behaviors are dedicated to highly exploring the search domain, whereas the foraging and evading predators behaviors provide exploitation during the optimization process. In addition, ALA incorporates an energy-decreasing mechanism that enables dynamic adjustments to the balance between exploration and exploitation, thereby enhancing its ability to evade local optima and converge to global solutions more robustly. To thoroughly verify the effectiveness of the proposed method, ALA is compared with 17 other state-of-the-art meta-heuristic algorithms on the IEEE CEC2017 benchmark test suite and the IEEE CEC2022 benchmark test suite. The experimental results indicate that ALA has reliable comprehensive optimization performance and can achieve superior solution accuracy, convergence speed, and stability in most test cases. For the 29 10-, 30-, 50-, and 100-dimensional CEC2017 functions, ALA obtains the lowest Friedman average ranking values among all competitor methods, which are 1.7241, 2.1034, 2.7241, and 2.9310, respectively, and for the 12 CEC2022 functions, ALA again wins the optimal Friedman average ranking of 2.1667. Finally, to further evaluate its applicability, ALA is implemented to address a series of optimization cases, including constrained engineering design, photovoltaic (PV) model parameter identification, and fractional-order proportional-differential-integral (FOPID) controller gain tuning. Our findings highlight the competitive edge and potential of ALA for real-world engineering applications. The source code of ALA is publicly available at https://github.com/StevenShaw98/Artificial-Lemming-Algorithm.

1 January 2022 in Mathematical Biosciences and Engineering
Verified
Journal Article
Open access
PDF file
YXYaning Xiao
Yaning Xiao
YGYanling Guo
Yanling Guo
HCHao Cui
Hao Cui
YWYangwei Wang
Yangwei Wang
JLJian Li
Jian Li
YZYapeng Zhang
Yapeng Zhang
Aquila Optimizer (AO) and African Vultures Optimization Algorithm (AVOA) are two newly developed meta-heuristic algorithms that simulate several intelligent hunting behaviors of Aquila and African vulture in nature, respectively. AO has powerful global exploration capability, whereas its local exploitation phase is not stable enough. On the other hand, AVOA possesses promising exploitation capability but insufficient exploration mechanisms. Based on the characteristics of both algorithms, in this paper, we propose an improved hybrid AO and AVOA optimizer called IHAOAVOA to overcome the deficiencies in the single algorithm and provide higher-quality solutions for solving global optimization problems. First, the exploration phase of AO and the exploitation phase of AVOA are combined to retain the valuable search competence of each. Then, a new composite opposition-based learning (COBL) is designed to increase the population diversity and help the hybrid algorithm escape from the local optima. In addition, to more effectively guide the search process and balance the exploration and exploitation, the fitness-distance balance (FDB) selection strategy is introduced to modify the core position update formula. The performance of the proposed IHAOAVOA is comprehensively investigated and analyzed by comparing against the basic AO, AVOA, and six state-of-the-art algorithms on 23 classical benchmark functions and the IEEE CEC2019 test suite. Experimental results demonstrate that IHAOAVOA achieves superior solution accuracy, convergence speed, and local optima avoidance than other comparison methods on most test functions. Furthermore, the practicality of IHAOAVOA is highlighted by solving five engineering design problems. Our findings reveal that the proposed technique is also highly competitive and promising when addressing real-world optimization tasks. The source code of the IHAOAVOA is publicly available at https://doi.org/10.24433/CO.2373662.v1.

14 March 2022 in Computer Modeling in Engineering & Sciences
Verified
Journal Article
Open access
YXYaning Xiao
Yaning Xiao
XSXue Sun
Xue Sun
YGYanling Guo
Yanling Guo
SLSanping Li
Sanping Li
YZYapeng Zhang
Yapeng Zhang
YWYangwei Wang
Yangwei Wang
Gorilla troops optimizer (GTO) is a newly developed meta-heuristic algorithm, which is inspired by the collective lifestyle and social intelligence of gorillas. Similar to other metaheuristics, the convergence accuracy and stability of GTO will deteriorate when the optimization problems to be solved become more complex and flexible. To overcome these defects and achieve better performance, this paper proposes an improved gorilla troops optimizer (IGTO). First, Circle chaotic mapping is introduced to initialize the positions of gorillas, which facilitates the population diversity and establishes a good foundation for global search. Then, in order to avoid getting trapped in the local optimum, the lens opposition-based learning mechanism is adopted to expand the search ranges. Besides, a novel local search-based algorithm, namely adaptive β-hill climbing, is amalgamated with GTO to increase the final solution precision. Attributed to three improvements, the exploration and exploitation capabilities of the basic GTO are greatly enhanced. The performance of the proposed algorithm is comprehensively evaluated and analyzed on 19 classical benchmark functions. The numerical and statistical results demonstrate that IGTO can provide better solution quality, local optimum avoidance, and robustness compared with the basic GTO and five other wellknown algorithms. Moreover, the applicability of IGTO is further proved through resolving four engineering design problems and training multilayer perceptron. The experimental results suggest that IGTO exhibits remarkable competitive performance and promising prospects in real-world tasks.

10 August 2022 in Journal of Intelligent & Fuzzy Systems: Applications in Engineering and Technology
Verified
Journal Article
Closed access
PDF file
YXYaning Xiao
Yaning Xiao
XSXue Sun
Xue Sun
YGYanling Guo
Yanling Guo
HCHao Cui
Hao Cui
YWYangwei Wang
Yangwei Wang
SLSanping Li
Sanping Li
Honey badger algorithm (HBA) is a recently developed meta-heuristic algorithm, which mainly simulates the dynamic search behavior of honey badger in wild nature. Similar to other basic algorithms, HBA may suffer from the weakness of poor convergence accuracy, inadequate balance between exploration and exploitation, and ease of getting trapped into the local optima. In order to address these drawbacks, this paper proposes an enhanced honey badger algorithm (EHBA) to improve the search quality of the basic method from three aspects. First, we introduce the highly disruptive polynomial mutation to initialize the population. This is considered from increasing the population diversity. Second, Lévy flight is integrated into the position update formula to boost search efficiency and balance exploration and exploitation capabilities of the algorithm. Furthermore, the refraction opposition-based learning is applied to the current global optimum of the swarm to help the population jump out of the local optima. To validate the function optimization performance, the proposed EHBA is comprehensively analyzed on 18 standard benchmark functions and IEEE CEC2017 test suite. Compared with the basic HBA and seven state-of-the-art algorithms, the experimental results demonstrate that EHBA can outperform other competitors on most of the test functions with superior solution accuracy, local optima avoidance, and stability. Additionally, the applicability of the proposed method is further highlighted by solving four engineering design problems. The results indicate that EHBA also has competitive performance and promising prospects for real-world optimization tasks.


1 December 2021
Verified
Journal Article
Closed access
YXYaning Xiao
Yaning Xiao
XSXue Sun
Xue Sun
YZYapeng Zhang
Yapeng Zhang
YGYanling Guo
Yanling Guo
YWYangwei Wang
Yangwei Wang
JLJian Li
Jian Li