Fei Li

Dr. Fei Li

School of Electrical and Information Engineering, Anhui University of Technology, Ma’anShan 243032, China.
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
27 December 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
FLFei Li
Fei Li
ZSZhengkun Shang
Zhengkun Shang
YLYuanchao Liu
Yuanchao Liu
HSHao Shen
Hao Shen
YJYaochu Jin
Yaochu Jin

8 February 2023 in IEEE Transactions on Emerging Topics in Computational Intelligence
Verified
Journal Article
Closed access
YLYuanchao Liu
Yuanchao Liu
JLJianchang Liu
Jianchang Liu
YJYaochu Jin
Yaochu Jin
FLFei Li
Fei Li
TZTianzi Zheng
Tianzi Zheng
Surrogate-assisted evolutionary algorithms (SAEAs) have been successfully employed for expensive optimization. However, most SAEAs are designed for expensive unconstrained optimization, and less attention has been paid to expensive optimization with inequality constraints. Therefore, this work proposes a novel SAEA, called surrogate-assisted two-stage differential evolution (SA-TSDE), for expensive constrained optimization. In the first search stage, surrogate-assisted hybrid differential evolution is adopted for prescreening promising solutions in the decision space for exploration. Moreover, an effective repair strategy, named surrogate based repair strategy, is introduced to move the infeasible solutions closer to the feasible region. In the second search stage, a clustering strategy of feasible solutions is proposed based on the information provided by the first search stage and historical search. The clustering strategy adaptively generates a number of clusters, each of which can form a promising local region for the local search. Afterwards, local surrogates are built for finding the predicted optima in each local region. During the search process, a good balance between exploration and exploitation can be obtained by interleaving the two search stages. Experimental results indicate that SA-TSDE is highly competitive compared with some state-of-the-art methods.

31 August 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
FLFei Li
Fei Li
QYQiang Yue
Qiang Yue
YLYuanchao Liu
Yuanchao Liu
HOHaibin Ouyang
Haibin Ouyang
FGFangqing Gu
Fangqing Gu


18 August 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
FLFei Li
Fei Li
YYYujie Yang
Yujie Yang
ZSZhengkun Shang
Zhengkun Shang
SLSiyuan Li
Siyuan Li
HOHaibin Ouyang
Haibin Ouyang

4 December 2018 in International Journal of Systems Science
Verified
Journal Article
Closed access
JLJianchang Liu
Jianchang Liu
FLFei Li
Fei Li
XKXiangyong Kong
Xiangyong Kong
PHPeiqiu Huang
Peiqiu Huang
An R2 indicator-based multi-objective particle swarm optimiser (R2-MOPSO) can obtain well-convergence and well-distributed solutions while solving two and three objectives optimisation problems. However, R2-MOPSO faces difficulty to tackle many-objective optimisation problems because balancing convergence and diversity is a key issue in high-dimensional objective space. In order to address this issue, this paper proposes a novel algorithm, named R2-MaPSO, which combines the R2 indicator and decomposition-based archiving pruning strategy into particle swarm optimiser for many-objective optimisation problems. The innovations of the proposed algorithm mainly contains three crucial factors: (1) A bi-level archiving maintenance approach based on the R2 indicator and objective space decomposition strategy is designed to balance convergence and diversity. (2) The global-best leader selection is based on the R2 indicator and the personal-best leader selection is based on the Pareto dominance. Meanwhile, the objective space decomposition leader selection adopts the feedback information from the bi-level archive. (3) A new velocity updated method is modified to enhance the exploration and exploitation ability. In addition, an elitist learning strategy and a smart Gaussian learning strategy are embedded into R2-MaPSO to help the algorithm jump out of the local optimal front. The performance of the proposed algorithm is validated and compared with some algorithms on a number of unconstraint benchmark problems, i.e. DTLZ1-DTLZ4, WFG test suites from 3 to 15 objectives. Experimental results have demonstrated a better performance of the proposed algorithm compared with several multi-objective particle swarm optimisers and multi-objective evolutionary algorithms for many-objective optimisation problems.