Ruxin Zhao
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
Ruxin Zhao has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
Chang Liu
School of Intelligent Manufacturing, Yangzhou Polytechnic institute, Yangzhou, China
4 shared publicationsLixiang Fu
School of Information Engineering, Yangzhou University, Yangzhou, China
4 shared publicationsYang Shi
School of Information Engineering, Yangzhou University, Yangzhou, China
4 shared publicationsChao Jiang
School of Information Engineering, Yangzhou University, Yangzhou, China
3 shared publicationsHongtan Zhang
School of Information Engineering, Yangzhou University, Yangzhou, China
3 shared publicationsJiajie Kang
School of Information Engineering, Yangzhou University, Yangzhou, China
3 shared publications
Latest Publications
- 14 September 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (13) , 745
Graph-guided data-driven evolutionary algorithm with multi-feature weight-fused modeling for distribution network reconfiguration optimization
- 14 September 2026
- Published by Springer Nature in Cluster Computing
- Vol. 29 (13) , 745
Graph-guided data-driven evolutionary algorithm with multi-feature weight-fused modeling for distribution network reconfiguration optimization
- 29 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (14) , 1-37
Ant colony optimization using eight-neighborhood search with dual pheromone updating strategy and continuous image edge generation strategy for license plate recognition
- 29 September 2025
- Published by Springer Nature in Cluster Computing
- Vol. 28 (14) , 1-37
Ant colony optimization using eight-neighborhood search with dual pheromone updating strategy and continuous image edge generation strategy for license plate recognition
- 8 September 2024
- Published by Springer Nature in Computational Economics
- Vol. 66 (1) , 207-240
An Adaptive Differential Evolution Algorithm Based on Data Preprocessing Method and a New Mutation Strategy to Solve Dynamic Economic Dispatch Considering Generator Constraints
- 8 September 2024
- Published by Springer Nature in Computational Economics
- Vol. 66 (1) , 207-240
An Adaptive Differential Evolution Algorithm Based on Data Preprocessing Method and a New Mutation Strategy to Solve Dynamic Economic Dispatch Considering Generator Constraints
- Open Access
- 17 March 2023
- Published by Springer Nature in Research Square
An adaptive differential evolution algorithm based on data preprocessing method to solve global optimization problem
Differential evolution (DE) algorithm is a classical natural-inspired optimization algorithm, which has good optimization performance. However, with the deepening of research, some researchers found that the quality of the candidate solution of the population in the differential evolution algorithm is poor and its global search ability is not enough when solving the global optimization problem. Therefore, in order to solve the above problems, we propose an adaptive differential evolution algorithm based on data processing method (ADEDPM). In this paper, the data preprocessing method is implemented by k-means clustering algorithm, which is used to divide the initial population into multiple clusters according to the average value of fitness, and select candidate solutions in each cluster according to different proportions. This method improves the quality of candidate solutions of the population to a certain extent. In addition, in order to solve the problem of insufficient global search ability in differential evolution algorithm, we also proposed a new mutation strategy, which is called “DE/current-to-𝑝1 best&𝑝2 best”. This strategy guides the search direction of the differential evolution algorithm by selecting individuals with good fitness, so that its search range in the most promising candidate solution region, and indirectly increases the population diversity of the algorithm. Finally, we propose an adaptive parameter control method, which can effectively balance the relationship between the exploration process and the exploitation process to achieve better performance of the algorithm. In order to verify the effectiveness of the proposed algorithm, the ADEDPM is compared with five optimization algorithms of the same type in the past three years, which are AAGSA, DFPSO, HGASSO, HHO and VAGWO, respectively. In the simulation experiment, 21 benchmark test functions and 4 engineering example problems are used, and the convergence accuracy, convergence speed, stability and rank sum test of the algorithm are fully compared. The experimental results show that compared with the five latest optimization algorithms of the same type, the proposed algorithm has strong competitiveness in each test index.
- 17 March 2023
- Published by Springer Nature in Research Square
Open AccessAn adaptive differential evolution algorithm based on data preprocessing method to solve global optimization problem
Differential evolution (DE) algorithm is a classical natural-inspired optimization algorithm, which has good optimization performance. However, with the deepening of research, some researchers found that the quality of the candidate solution of the population in the differential evolution algorithm is poor and its global search ability is not enough when solving the global optimization problem. Therefore, in order to solve the above problems, we propose an adaptive differential evolution algorithm based on data processing method (ADEDPM). In this paper, the data preprocessing method is implemented by k-means clustering algorithm, which is used to divide the initial population into multiple clusters according to the average value of fitness, and select candidate solutions in each cluster according to different proportions. This method improves the quality of candidate solutions of the population to a certain extent. In addition, in order to solve the problem of insufficient global search ability in differential evolution algorithm, we also proposed a new mutation strategy, which is called “DE/current-to-𝑝1 best&𝑝2 best”. This strategy guides the search direction of the differential evolution algorithm by selecting individuals with good fitness, so that its search range in the most promising candidate solution region, and indirectly increases the population diversity of the algorithm. Finally, we propose an adaptive parameter control method, which can effectively balance the relationship between the exploration process and the exploitation process to achieve better performance of the algorithm. In order to verify the effectiveness of the proposed algorithm, the ADEDPM is compared with five optimization algorithms of the same type in the past three years, which are AAGSA, DFPSO, HGASSO, HHO and VAGWO, respectively. In the simulation experiment, 21 benchmark test functions and 4 engineering example problems are used, and the convergence accuracy, convergence speed, stability and rank sum test of the algorithm are fully compared. The experimental results show that compared with the five latest optimization algorithms of the same type, the proposed algorithm has strong competitiveness in each test index.
- Open Access
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (2) , 533-548
Hybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
The job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. The problem has captured the interest of a significant number of researchers, but no efficient solution algorithm has been found yet for solving it to optimality in polynomial time. In this paper, a hybrid social-spider optimization algorithm with differential mutation operator is presented to solve the job-shop scheduling problem. To improve the exploration capabilities of the social spider optimization algorithm (SSO), we incorporate the DM operator (a mutation operator taken from the deferential evolutionary (DE) algorithm) into the framework of the female cooperative operator. The experimental results show that the proposed method effectiveness in solving job-shop scheduling compared to other optimization algorithms in the literature.
- 1 January 2021
- Published by American Institute of Mathematical Sciences (AIMS) in Journal of Industrial and Management Optimization
- Vol. 17 (2) , 533-548
Open AccessHybrid social spider optimization algorithm with differential mutation operator for the job-shop scheduling problem
The job-shop scheduling problem is one of the well-known hardest combinatorial optimization problems. The problem has captured the interest of a significant number of researchers, but no efficient solution algorithm has been found yet for solving it to optimality in polynomial time. In this paper, a hybrid social-spider optimization algorithm with differential mutation operator is presented to solve the job-shop scheduling problem. To improve the exploration capabilities of the social spider optimization algorithm (SSO), we incorporate the DM operator (a mutation operator taken from the deferential evolutionary (DE) algorithm) into the framework of the female cooperative operator. The experimental results show that the proposed method effectiveness in solving job-shop scheduling compared to other optimization algorithms in the literature.
- 14 January 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (6) , 2339-2381
Selfish herds optimization algorithm with orthogonal design and information update for training multi-layer perceptron neural network
- 14 January 2019
- Published by Springer Nature in Applied Intelligence
- Vol. 49 (6) , 2339-2381
Selfish herds optimization algorithm with orthogonal design and information update for training multi-layer perceptron neural network
- Open Access
- 8 January 2017
- Published by MDPI AG in Algorithms
- Vol. 10 (1) , 9
Elite Opposition-Based Social Spider Optimization Algorithm for Global Function Optimization
The Social Spider Optimization algorithm (SSO) is a novel metaheuristic optimization algorithm. To enhance the convergence speed and computational accuracy of the algorithm, in this paper, an elite opposition-based Social Spider Optimization algorithm (EOSSO) is proposed; we use an elite opposition-based learning strategy to enhance the convergence speed and computational accuracy of the SSO algorithm. The 23 benchmark functions are tested, and the results show that the proposed elite opposition-based Social Spider Optimization algorithm is able to obtain an accurate solution, and it also has a fast convergence speed and a high degree of stability.
- 8 January 2017
- Published by MDPI AG in Algorithms
- Vol. 10 (1) , 9
Open AccessElite Opposition-Based Social Spider Optimization Algorithm for Global Function Optimization
The Social Spider Optimization algorithm (SSO) is a novel metaheuristic optimization algorithm. To enhance the convergence speed and computational accuracy of the algorithm, in this paper, an elite opposition-based Social Spider Optimization algorithm (EOSSO) is proposed; we use an elite opposition-based learning strategy to enhance the convergence speed and computational accuracy of the SSO algorithm. The 23 benchmark functions are tested, and the results show that the proposed elite opposition-based Social Spider Optimization algorithm is able to obtain an accurate solution, and it also has a fast convergence speed and a high degree of stability.