Xiaoxia Han

Prof. Dr. Xiaoxia Han


Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
12 October 2020 in Environmental Science and Pollution Research
Verified
Journal Article
Closed access
PDF file
JCJunwen Chu
Junwen Chu
YDYingchao Dong
Yingchao Dong
XHXiaoxia Han
Xiaoxia Han
JXJun Xie
Jun Xie
XXXinying Xu
Xinying Xu
GXGang Xie
Gang Xie

1 December 2017 in Applied Surface Science
Verified
Journal Article
Closed access
WSWei Sun
Wei Sun
RSRuina Shi
Ruina Shi
XWXuhui Wang
Xuhui Wang
SLShusen Liu
Shusen Liu
XHXiaoxia Han
Xiaoxia Han
JRJun Ren
Jun Ren

2 April 2019 in IEEE Access
Verified
Journal Article
Open access
XHXiaoxia Han
Xiaoxia Han
YDYingchao Dong
Yingchao Dong
LYLin Yue
Lin Yue
QXQuanxi Xu
Quanxi Xu
A simulated annealing (SA) algorithm is an effective method for solving optimization problems, especially for combinatorial optimization problems. However, SA algorithms rely heavily on the iterative mechanism of the neighborhood structure. When the scale of the problem becomes larger, the convergence rate is slow and it is difficult to reach the global optimal solution. In this paper, seven special intelligent operators are introduced to an SA algorithm, and therefore a new state transition simulated annealing (STASA) algorithm is proposed for combinatorial optimization and continuous optimization problems. The performance of the STASA algorithm is tested on the traveling salesman problem and some continuous function optimization problems. The experimental results show that the proposed algorithm is efficient and reliable.

26 February 2020 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
XHXiaoxia Han
Xiaoxia Han
LYLin Yue
Lin Yue
YDYingchao Dong
Yingchao Dong
QXQuanxi Xu
Quanxi Xu
GXGang Xie
Gang Xie
XXXinying Xu
Xinying Xu

12 March 2020 in IEEE Access
Verified
Journal Article
Open access
XHXiaoxia Han
Xiaoxia Han
QXQuanxi Xu
Quanxi Xu
LYLin Yue
Lin Yue
YDYingchao Dong
Yingchao Dong
GXGang Xie
Gang Xie
XXXinying Xu
Xinying Xu
The crow search algorithm (CSA) is a new intelligent optimization algorithm based on the behavior of the crow population, which has been proven to perform well. However, its simple search mechanism also leads to the algorithm’s slow convergence speed and its ease of falling into local optimization when solving complex optimization problems. In order to overcome these problems, this paper proposes an improved CSA (ISCSA) based on a spiral search mechanism. By introducing a weight coefficient, an optimal guidance position and a spiral search mechanism, the position equation was updated to accelerate the convergence of the algorithm and make the exploration and exploitation of CSA more balanced. Meanwhile, adding Gaussian variation and random perturbation strategy made it difficult for the algorithm to fall into local optimization. The advantages of the proposed ISCSA were evaluated using 23 benchmark functions and four classical engineering design problems. The experimental and statistical results of 23 test functions showed that the proposed ISCSA could escape from the local optima with higher accuracy and faster convergence than both the CSA and other meta-heuristic optimization algorithms. The calculation results of the four engineering optimization problems showed that compared with other algorithms, ISCSA can solve the practical optimization problem well and has been proved to have strong competitiveness and good performance.

29 March 2021 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
YZYan Zhang
Yan Zhang
XHXiaoxia Han
Xiaoxia Han
YDYingchao Dong
Yingchao Dong
JXJun Xie
Jun Xie
GXGang Xie
Gang Xie
XXXinying Xu
Xinying Xu