Lei Zhao

Lei Zhao

Auto-generated profile, based on publicly available information

Lei Zhao

School of Electronic Information Engineering, Hebei University of Technology, Tianjin 300401, 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
1 January 2017 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
LZLei Zhao
Lei Zhao
ZJZhicheng Jia
Zhicheng Jia
LCLei Chen
Lei Chen
YGYanju Guo
Yanju Guo
Backtracking search algorithm (BSA) is a relatively new evolutionary algorithm, which has a good optimization performance just like other population‐based algorithms. However, there is also an insufficiency in BSA regarding its convergence speed and convergence precision. For solving the problem shown in BSA, this article proposes an improved BSA named COBSA. Enlightened by particle swarm optimization (PSO) algorithm, population control factor is added to the variation equation aiming to improve the convergence speed of BSA, so as to make algorithm have a better ability of escaping the local optimum. In addition, enlightened by differential evolution (DE) algorithm, this article proposes a novel evolutionary equation based on the fact that the disadvantaged group will search just around the best individual chosen from previous iteration to enhance the ability of local search. Simulation experiments based on a set of 18 benchmark functions show that, in general, COBSA displays obvious superiority in convergence speed and convergence precision when compared with BSA and the comparison algorithms.