Xiaolu Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Xiaolu Wang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Yunpeng Ma
School of Information Engineering, Tianjin University of Commerce, Beichen, Tianjin 300134, China
2 shared publications - Peng Gu
School of Information Engineering, Tianjin University of Commerce, Beichen, Tianjin 300134, China
1 shared publication - Wanting Meng
College of Science, Tianjin University of Commerce, Beichen, Tianjin 300134, China
1 shared publication - Wanting Meng
School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha 410114, China
1 shared publication - Xinxin Zhang
School of Information Engineering, Tianjin University of Commerce, Beichen, Tianjin 300134, China
1 shared publication
Latest Publications
- Open Access
- 8 May 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (5) , 299
Modified Sparrow Search Algorithm by Incorporating Multi-Strategy for Solving Mathematical Optimization Problems
The Sparrow Search Algorithm (SSA), proposed by Jiankai Xue in 2020, is a swarm intelligence optimization algorithm that has received extensive attention due to its powerful optimization-seeking ability and rapid convergence. However, similar to other swarm intelligence algorithms, the SSA has the problem of being prone to falling into local optimal solutions during the optimization process, which limits its application effectiveness. To overcome this limitation, this paper proposes a Modified Sparrow Search Algorithm (MSSA), which enhances the algorithm’s performance by integrating three optimization strategies. Specifically, the Latin Hypercube Sampling (LHS) method is employed to achieve a uniform distribution of the initial population, laying a solid foundation for global search. An adaptive weighting mechanism is introduced in the producer update phase to dynamically adjust the search step size, effectively reducing the risk of the algorithm falling into local optima in later iterations. Meanwhile, the cat mapping perturbation and Cauchy mutation operations are integrated to further enhance the algorithm’s global exploration ability and local development efficiency, accelerating the convergence process and improving the quality of the solutions. This study systematically validates the performance of the MSSA through multi-dimensional experiments. The MSSA demonstrates excellent optimization performance on 23 benchmark test functions and the CEC2019 standard test function set. Its application to three practical engineering problems, namely the design of welded beams, reducers, and cantilever beams, successfully verifies the effectiveness of the algorithm in real-world scenarios. By comparing it with deterministic algorithms such as DIRET and BIRMIN, and based on the five-dimensional test functions generated by the GKLS generator, the global optimization ability of the MSSA is thoroughly evaluated. In addition, the successful application of the MSSA to the problem of robot path planning further highlights its application advantages in complex practical scenarios. Experimental results show that, compared with the original SSA, the MSSA has achieved significant improvements in terms of convergence speed, optimization accuracy, and robustness, providing new ideas and methods for the research and practical application of swarm intelligence optimization algorithms.
- 8 May 2025
- Published by MDPI AG in Biomimetics
- Vol. 10 (5) , 299
Open AccessModified Sparrow Search Algorithm by Incorporating Multi-Strategy for Solving Mathematical Optimization Problems
The Sparrow Search Algorithm (SSA), proposed by Jiankai Xue in 2020, is a swarm intelligence optimization algorithm that has received extensive attention due to its powerful optimization-seeking ability and rapid convergence. However, similar to other swarm intelligence algorithms, the SSA has the problem of being prone to falling into local optimal solutions during the optimization process, which limits its application effectiveness. To overcome this limitation, this paper proposes a Modified Sparrow Search Algorithm (MSSA), which enhances the algorithm’s performance by integrating three optimization strategies. Specifically, the Latin Hypercube Sampling (LHS) method is employed to achieve a uniform distribution of the initial population, laying a solid foundation for global search. An adaptive weighting mechanism is introduced in the producer update phase to dynamically adjust the search step size, effectively reducing the risk of the algorithm falling into local optima in later iterations. Meanwhile, the cat mapping perturbation and Cauchy mutation operations are integrated to further enhance the algorithm’s global exploration ability and local development efficiency, accelerating the convergence process and improving the quality of the solutions. This study systematically validates the performance of the MSSA through multi-dimensional experiments. The MSSA demonstrates excellent optimization performance on 23 benchmark test functions and the CEC2019 standard test function set. Its application to three practical engineering problems, namely the design of welded beams, reducers, and cantilever beams, successfully verifies the effectiveness of the algorithm in real-world scenarios. By comparing it with deterministic algorithms such as DIRET and BIRMIN, and based on the five-dimensional test functions generated by the GKLS generator, the global optimization ability of the MSSA is thoroughly evaluated. In addition, the successful application of the MSSA to the problem of robot path planning further highlights its application advantages in complex practical scenarios. Experimental results show that, compared with the original SSA, the MSSA has achieved significant improvements in terms of convergence speed, optimization accuracy, and robustness, providing new ideas and methods for the research and practical application of swarm intelligence optimization algorithms.
- Open Access
- 22 September 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (9) , 576
A Reinforced Whale Optimization Algorithm for Solving Mathematical Optimization Problems
The whale optimization algorithm has several advantages, such as simple operation, few control parameters, and a strong ability to jump out of the local optimum, and has been used to solve various practical optimization problems. In order to improve its convergence speed and solution quality, a reinforced whale optimization algorithm (RWOA) was designed. Firstly, an opposition-based learning strategy is used to generate other optima based on the best optimal solution found during the algorithm’s iteration, which can increase the diversity of the optimal solution and accelerate the convergence speed. Secondly, a dynamic adaptive coefficient is introduced in the two stages of prey and bubble net, which can balance exploration and exploitation. Finally, a kind of individual information-reinforced mechanism is utilized during the encircling prey stage to improve the solution quality. The performance of the RWOA is validated using 23 benchmark test functions, 29 CEC-2017 test functions, and 12 CEC-2022 test functions. Experiment results demonstrate that the RWOA exhibits better convergence accuracy and algorithm stability than the WOA on 20 benchmark test functions, 21 CEC-2017 test functions, and 8 CEC-2022 test functions, separately. Wilcoxon’s rank sum test shows that there are significant statistical differences between the RWOA and other algorithms
- 22 September 2024
- Published by MDPI AG in Biomimetics
- Vol. 9 (9) , 576
Open AccessA Reinforced Whale Optimization Algorithm for Solving Mathematical Optimization Problems
The whale optimization algorithm has several advantages, such as simple operation, few control parameters, and a strong ability to jump out of the local optimum, and has been used to solve various practical optimization problems. In order to improve its convergence speed and solution quality, a reinforced whale optimization algorithm (RWOA) was designed. Firstly, an opposition-based learning strategy is used to generate other optima based on the best optimal solution found during the algorithm’s iteration, which can increase the diversity of the optimal solution and accelerate the convergence speed. Secondly, a dynamic adaptive coefficient is introduced in the two stages of prey and bubble net, which can balance exploration and exploitation. Finally, a kind of individual information-reinforced mechanism is utilized during the encircling prey stage to improve the solution quality. The performance of the RWOA is validated using 23 benchmark test functions, 29 CEC-2017 test functions, and 12 CEC-2022 test functions. Experiment results demonstrate that the RWOA exhibits better convergence accuracy and algorithm stability than the WOA on 20 benchmark test functions, 21 CEC-2017 test functions, and 8 CEC-2022 test functions, separately. Wilcoxon’s rank sum test shows that there are significant statistical differences between the RWOA and other algorithms