Li Li

Dr. Li Li


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 May 2019 in Neurocomputing
Verified
Journal Article
Closed access
WWWan Liang Wang
Wan Liang Wang
WLWei Kun Li
Wei Kun Li
ZWZheng Wang
Zheng Wang
LLLi Li
Li Li

1 January 2017 in Information Sciences
Verified
Journal Article
Closed access
LLLi Li
Li Li
WWWanliang Wang
Wanliang Wang
XXXinli Xu
Xinli Xu

1 November 2020 in Applied Soft Computing
Verified
Journal Article
Closed access
LLLi Li
Li Li
GLGuangpeng Li
Guangpeng Li
LCLiang Chang
Liang Chang

30 April 2018 in Water Resources Management
Verified
Journal Article
Closed access
PDF file
WLWei Kun Li
Wei Kun Li
WWWan Liang Wang
Wan Liang Wang
LLLi Li
Li Li

1 August 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
LLLi Li
Li Li
LCLiang Chang
Liang Chang
TGTianlong Gu
Tianlong Gu
WSWeiguo Sheng
Weiguo Sheng
WWWanliang Wang
Wanliang Wang
Recent studies in multiobjective particle swarm optimization (PSO) have the tendency to employ Pareto-based technique, which has a certain effect. However, they will encounter difficulties in their scalability upon many-objective optimization problems (MaOPs) due to the poor discriminability of Pareto optimality, which will affect the selection of leaders, thereby deteriorating the effectiveness of the algorithm. This paper presents a new scheme of discriminating the solutions in objective space. Based on the properties of Pareto optimality, we propose the dominant difference of a solution, which can demonstrate its dominance in every dimension. By investigating the norm of dominant difference among the entire population, the discriminability between the candidates that are difficult to obtain in the objective space is obtained indirectly. By integrating it into PSO, we gained a novel algorithm named many-objective PSO based on the norm of dominant difference (MOPSO/DD) for dealing with MaOPs. Moreover, we design a Lp-norm-based density estimator which makes MOPSO/DD not only have good convergence and diversity but also have lower complexity. Experiments on benchmark problems demonstrate that our proposal is competitive with respect to the state-of-the-art MOPSOs and multiobjective evolutionary algorithms.

1 August 2017 in Applied Soft Computing
Verified
Journal Article
Closed access
SYSenliang Ying
Senliang Ying
LLLi Li
Li Li
ZWZheng Wang
Zheng Wang
WLWeikun Li
Weikun Li
WWWanliang Wang
Wanliang Wang