Shengpu Li

Prof. Dr. Shengpu Li

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
11 December 2018 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
SLShengpu Li
Shengpu Li
YSYize Sun
Yize Sun

24 July 2019 in Concurrency and Computation: Practice and Experience
Verified
Journal Article
Closed access
PDF file
SLShengpu Li
Shengpu Li
YSYize Sun
Yize Sun

8 May 2022 in Systems Science & Control Engineering
Verified
Journal Article
Open access
XWXiaohui Wang
Xiaohui Wang
SLShengpu Li
Shengpu Li
Garden balsam optimization (GBO) is a new proposed evolutionary algorithm based on swarm intelligence. Convergence and time complexity analyses are very important in evolutionary computation, but the research on GBO is still blank. Same as other evolutionary algorithms, the optimization process of the GBO algorithm can be regarded as a Markov process. In this paper, a Markov stochastic model of the GBO algorithm is defined and used to prove the convergence of GBO algorithm. Finally, the approximation region of the estimated convergence time of GBO algorithm is calculated, which characterizes the evolution of the evolutionary process of the proposed algorithm.

29 May 2022 in Applied Sciences
Verified
Journal Article
Open access
PDF file
XWXiaohui Wang
Xiaohui Wang
SLShengpu Li
Shengpu Li
Traditional multi-objective evolutionary algorithms (MOEAs) consider multiple objectives as a whole when solving multi-objective optimization problems (MOPs). In this paper, the hybridization of garden balsam optimization (GBO) is presented to solve multi-objective optimization, applying multiple populations for multiple objectives individually. Moreover, in order to improve the diversity of the solutions, both crowding distance computations and epsilon dominance relations are adopted when updating the archive. Furthermore, an efficient selection procedure called co-evolutionary multi-swarm garden balsam optimization (CMGBO) is proposed to ensure the convergence of well-diversified Pareto regions. The performance of the used algorithm is validated on 12 test functions. The algorithm is employed to solve four real-world problems in engineering. The achieved consequences corroborate the advantage of the proposed algorithm with regard to convergence and diversity.