Ruxin Zhao

Ruxin Zhao

Auto-generated profile, based on publicly available information

Ruxin Zhao

School of Information Engineering, Yangzhou University, Yangzhou, China

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

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

Representative Publications

View All Publications
8 January 2017 in Algorithms
Verified
Journal Article
Open access
PDF file
RZRuxin Zhao
Ruxin Zhao
QLQifang Luo
Qifang Luo
YZYongquan Zhou
Yongquan Zhou
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.

14 January 2019 in Applied Intelligence
Verified
Journal Article
Closed access
PDF file
RZRuxin Zhao
Ruxin Zhao
YWYongi Wang
Yongi Wang
PHPeng Hu
Peng Hu
HJHamed Jelodar
Hamed Jelodar
CYChi Yuan
Chi Yuan
MRMahdi Rabbani
Mahdi Rabbani

17 February 2025 in Applied Soft Computing
Verified
Journal Article
Closed access
RZRuxin Zhao
Ruxin Zhao
LFLixiang Fu
Lixiang Fu
JKJiajie Kang
Jiajie Kang
CLChang Liu
Chang Liu
WWWei Wang
Wei Wang
RWRui Wang
Rui Wang

1 January 2021 in Journal of Industrial and Management Optimization
Verified
Journal Article
Open access
PDF file
GZGuo Zhou
Guo Zhou
YZYongquan Zhou
Yongquan Zhou
RZRuxin Zhao
Ruxin Zhao
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.


8 September 2024 in Computational Economics
Verified
Journal Article
Closed access
PDF file
RZRuxin Zhao
Ruxin Zhao
WWWei Wang
Wei Wang
TZTingting Zhang
Tingting Zhang
CLChang Liu
Chang Liu
LFLixiang Fu
Lixiang Fu
CJChao Jiang
Chao Jiang