Rong Zheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Rong Zheng has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Heming Jia
School of Information Engineering, Sanming University, Sanming, China
8 shared publications - Abdelazim G. Hussien
Linköping University
6 shared publications - Shuang Wang
School of Information Engineering, Sanming University, Sanming 365004, China
5 shared publications - Laith Abualigah
Computer Science Department, Al al-Bayt University, Mafraq, Jordan
4 shared publications Laith Abualigah
Prince Hussein Bin Abdullah College for Information Technology, Al Al-Bayt University , Mafraq 130040, Jordan
3 shared publications- Di Wu
School of Education and Music, Sanming University , 365004 Sanming , China
2 shared publications
Latest Publications
- 28 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 702
BFCH-SMOTE: Boundary fusion convex hull synthetic minority oversampling technique
- 28 July 2026
- Published by Elsevier in Neurocomputing
- Vol. 702
BFCH-SMOTE: Boundary fusion convex hull synthetic minority oversampling technique
- 19 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (13) , 1-44
ESHO: improved seahorse optimization using restart and adaptive mutation strategies
- 19 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (13) , 1-44
ESHO: improved seahorse optimization using restart and adaptive mutation strategies
- Open Access
- 14 May 2025
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 127, 296-308
The influence of fear effect and phase of chaos control of discrete predator–prey system with mixed Holling types
- 14 May 2025
- Published by Elsevier in Alexandria Engineering Journal
- Vol. 127, 296-308
Open AccessThe influence of fear effect and phase of chaos control of discrete predator–prey system with mixed Holling types
- 12 March 2025
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 32 (5) , 2917-2986
A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results
- 12 March 2025
- Published by Springer Nature in Archives of Computational Methods in Engineering
- Vol. 32 (5) , 2917-2986
A Comprehensive Review of the Tunicate Swarm Algorithm: Variations, Applications, and Results
- Open Access
- 15 November 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (1) , 1-50
A multi-strategy boosted bald eagle search algorithm for global optimization and constrained engineering problems: case study on MLP classification problems
- 15 November 2024
- Published by Springer Nature in Artificial Intelligence Review
- Vol. 58 (1) , 1-50
Open AccessA multi-strategy boosted bald eagle search algorithm for global optimization and constrained engineering problems: case study on MLP classification problems
- Open Access
- 11 January 2023
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 10 (1) , 329-356
A multi-strategy enhanced African vultures optimization algorithm for global optimization problems
The African vultures optimization algorithm (AVOA) is a recently proposed metaheuristic inspired by the African vultures’ behaviors. Though the basic AVOA performs very well for most optimization problems, it still suffers from the shortcomings of slow convergence rate and local optimal stagnation when solving complex optimization tasks. Therefore, this study introduces a modified version named enhanced AVOA (EAVOA). The proposed EAVOA uses three different techniques namely representative vulture selection strategy, rotating flight strategy, and selecting accumulation mechanism, respectively, which are developed based on the basic AVOA. The representative vulture selection strategy strikes a good balance between global and local searches. The rotating flight strategy and selecting accumulation mechanism are utilized to improve the quality of the solution. The performance of EAVOA is validated on 23 classical benchmark functions with various types and dimensions and compared to those of nine other state-of-the-art methods according to numerical results and convergence curves. In addition, three real-world engineering design optimization problems are adopted to evaluate the practical applicability of EAVOA. Furthermore, EAVOA has been applied to classify multi-layer perception using XOR and cancer datasets. The experimental results clearly show that the EAVOA has superiority over other methods.
- 11 January 2023
- Published by Oxford University Press (OUP) in Journal of Computational Design and Engineering
- Vol. 10 (1) , 329-356
Open AccessA multi-strategy enhanced African vultures optimization algorithm for global optimization problems
The African vultures optimization algorithm (AVOA) is a recently proposed metaheuristic inspired by the African vultures’ behaviors. Though the basic AVOA performs very well for most optimization problems, it still suffers from the shortcomings of slow convergence rate and local optimal stagnation when solving complex optimization tasks. Therefore, this study introduces a modified version named enhanced AVOA (EAVOA). The proposed EAVOA uses three different techniques namely representative vulture selection strategy, rotating flight strategy, and selecting accumulation mechanism, respectively, which are developed based on the basic AVOA. The representative vulture selection strategy strikes a good balance between global and local searches. The rotating flight strategy and selecting accumulation mechanism are utilized to improve the quality of the solution. The performance of EAVOA is validated on 23 classical benchmark functions with various types and dimensions and compared to those of nine other state-of-the-art methods according to numerical results and convergence curves. In addition, three real-world engineering design optimization problems are adopted to evaluate the practical applicability of EAVOA. Furthermore, EAVOA has been applied to classify multi-layer perception using XOR and cancer datasets. The experimental results clearly show that the EAVOA has superiority over other methods.
- Open Access
- 16 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (10) , 1696
Enhanced Remora Optimization Algorithm for Solving Constrained Engineering Optimization Problems
Remora Optimization Algorithm (ROA) is a recent population-based algorithm that mimics the intelligent traveler behavior of Remora. However, the performance of ROA is barely satisfactory; it may be stuck in local optimal regions or has a slow convergence, especially in high dimensional complicated problems. To overcome these limitations, this paper develops an improved version of ROA called Enhanced ROA (EROA) using three different techniques: adaptive dynamic probability, SFO with Levy flight, and restart strategy. The performance of EROA is tested using two different benchmarks and seven real-world engineering problems. The statistical analysis and experimental results show the efficiency of EROA.
- 16 May 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (10) , 1696
Open AccessEnhanced Remora Optimization Algorithm for Solving Constrained Engineering Optimization Problems
Remora Optimization Algorithm (ROA) is a recent population-based algorithm that mimics the intelligent traveler behavior of Remora. However, the performance of ROA is barely satisfactory; it may be stuck in local optimal regions or has a slow convergence, especially in high dimensional complicated problems. To overcome these limitations, this paper develops an improved version of ROA called Enhanced ROA (EROA) using three different techniques: adaptive dynamic probability, SFO with Levy flight, and restart strategy. The performance of EROA is tested using two different benchmarks and seven real-world engineering problems. The statistical analysis and experimental results show the efficiency of EROA.
- Open Access
- 14 April 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (8) , 1311
An Improved Wild Horse Optimizer for Solving Optimization Problems
Wild horse optimizer (WHO) is a recently proposed metaheuristic algorithm that simulates the social behavior of wild horses in nature. Although WHO shows competitive performance compared to some algorithms, it suffers from low exploitation capability and stagnation in local optima. This paper presents an improved wild horse optimizer (IWHO), which incorporates three improvements to enhance optimizing capability. The main innovation of this paper is to put forward the random running strategy (RRS) and the competition for waterhole mechanism (CWHM). The random running strategy is employed to balance exploration and exploitation, and the competition for waterhole mechanism is proposed to boost exploitation behavior. Moreover, the dynamic inertia weight strategy (DIWS) is utilized to optimize the global solution. The proposed IWHO is evaluated using twenty-three classical benchmark functions, ten CEC 2021 test functions, and five real-world optimization problems. High-dimensional cases (D = 200, 500, 1000) are also tested. Comparing nine well-known algorithms, the experimental results of test functions demonstrate that the IWHO is very competitive in terms of convergence speed, precision, accuracy, and stability. Further, the practical capability of the proposed method is verified by the results of engineering design problems.
- 14 April 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (8) , 1311
Open AccessAn Improved Wild Horse Optimizer for Solving Optimization Problems
Wild horse optimizer (WHO) is a recently proposed metaheuristic algorithm that simulates the social behavior of wild horses in nature. Although WHO shows competitive performance compared to some algorithms, it suffers from low exploitation capability and stagnation in local optima. This paper presents an improved wild horse optimizer (IWHO), which incorporates three improvements to enhance optimizing capability. The main innovation of this paper is to put forward the random running strategy (RRS) and the competition for waterhole mechanism (CWHM). The random running strategy is employed to balance exploration and exploitation, and the competition for waterhole mechanism is proposed to boost exploitation behavior. Moreover, the dynamic inertia weight strategy (DIWS) is utilized to optimize the global solution. The proposed IWHO is evaluated using twenty-three classical benchmark functions, ten CEC 2021 test functions, and five real-world optimization problems. High-dimensional cases (D = 200, 500, 1000) are also tested. Comparing nine well-known algorithms, the experimental results of test functions demonstrate that the IWHO is very competitive in terms of convergence speed, precision, accuracy, and stability. Further, the practical capability of the proposed method is verified by the results of engineering design problems.
- 4 April 2022
- Published by Elsevier in Fire Safety Journal
- Vol. 130, 103574
Research on the aerosol identification method for the fire smoke detection in aircraft cargo compartment
- 4 April 2022
- Published by Elsevier in Fire Safety Journal
- Vol. 130, 103574
Research on the aerosol identification method for the fire smoke detection in aircraft cargo compartment
- Open Access
Enhance Teaching-Learning-Based Optimization for Tsallis-Entropy-Based Feature Selection Classification Approach
Feature selection is an effective method to reduce the number of data features, which boosts classification performance in machine learning. This paper uses the Tsallis-entropy-based feature selection to detect the significant feature. Support Vector Machine (SVM) is adopted as the classifier for classification purposes in this paper. We proposed an enhanced Teaching-Learning-Based Optimization (ETLBO) to optimize the SVM and Tsallis entropy parameters to improve classification accuracy. The adaptive weight strategy and Kent chaotic map are used to enhance the optimal ability of the traditional TLBO. The proposed method aims to avoid the main weaknesses of the original TLBO, which is trapped in local optimal and unbalance between the search mechanisms. Experiments based on 16 classical datasets are selected to test the performance of the ETLBO, and the results are compared with other well-established optimization algorithms. The obtained results illustrate that the proposed method has better performance in classification accuracy.
Open AccessEnhance Teaching-Learning-Based Optimization for Tsallis-Entropy-Based Feature Selection Classification Approach
Feature selection is an effective method to reduce the number of data features, which boosts classification performance in machine learning. This paper uses the Tsallis-entropy-based feature selection to detect the significant feature. Support Vector Machine (SVM) is adopted as the classifier for classification purposes in this paper. We proposed an enhanced Teaching-Learning-Based Optimization (ETLBO) to optimize the SVM and Tsallis entropy parameters to improve classification accuracy. The adaptive weight strategy and Kent chaotic map are used to enhance the optimal ability of the traditional TLBO. The proposed method aims to avoid the main weaknesses of the original TLBO, which is trapped in local optimal and unbalance between the search mechanisms. Experiments based on 16 classical datasets are selected to test the performance of the ETLBO, and the results are compared with other well-established optimization algorithms. The obtained results illustrate that the proposed method has better performance in classification accuracy.