Nana Li

Nana Li

Auto-generated profile, based on publicly available information

Nana Li

School of Data Science and Information Engineering, GuiZhou Minzu University, Guiyang 550025, China

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
7 December 2021 in Journal of Mathematics
Verified
Journal Article
Open access
PDF file
KZKangge Zou
Kangge Zou
YLYanmin Liu
Yanmin Liu
SWShihua Wang
Shihua Wang
NLNana Li
Nana Li
YWYaowei Wu
Yaowei Wu
When faced with complex optimization problems with multiple objectives and multiple variables, many multiobjective particle swarm algorithms are prone to premature convergence. To enhance the convergence and diversity of the multiobjective particle swarm algorithm, a multiobjective particle swarm optimization algorithm based on the grid technique and multistrategy (GTMSMOPSO) is proposed. The algorithm randomly uses one of two different evaluation index strategies (convergence evaluation index and distribution evaluation index) combined with the grid technique to enhance the diversity and convergence of the population and improve the probability of particles flying to the real Pareto front. A combination of grid technology and a mixed evaluation index strategy is used to maintain the external archive to avoid removing particles with better convergence based only on particle density, which leads to population degradation and affects the particle exploitation ability. At the same time, a variation operation is proposed to avoid rapid degradation of the population, which enhances the particle search capability. The simulation results show that the proposed algorithm has better convergence and distribution than CMOPSO, NSGAII, MOEAD, MOPSOCD, and NMPSO.

1 January 2021 in Computational Intelligence and Neuroscience
Verified
Journal Article
Open access
PDF file
NLNana Li
Nana Li
YLYanmin Liu
Yanmin Liu
QSQijun Shi
Qijun Shi
SWShihua Wang
Shihua Wang
KZKangge Zou
Kangge Zou
The optimization problems are taking place at all times in actual lives. They are divided into single objective problems and multiobjective problems. Single objective optimization has only one objective function, while multiobjective optimization has multiple objective functions that generate the Pareto set. Therefore, to solve multiobjective problems is a challenging task. A multiobjective particle swarm optimization, which combined cosine distance measurement mechanism and novel game strategy, has been proposed in this article. The cosine distance measurement mechanism was adopted to update Pareto optimal set in the external archive. At the same time, the candidate set was established so that Pareto optimal set deleted from the external archive could be effectively replaced, which helped to maintain the size of the external archive and improved the convergence and diversity of the swarm. In order to strengthen the selection pressure of leader, this article combined with the game update mechanism, and a global leader selection strategy that integrates the game strategy including the cosine distance mechanism was proposed. In addition, mutation was used to maintain the diversity of the swarm and prevent the swarm from prematurely converging to the true Pareto front. The performance of the proposed competitive multiobjective particle swarm optimizer was verified by benchmark comparisons with several state‐of‐the‐art multiobjective optimizer, including seven multiobjective particle swarm optimization algorithms and seven multiobjective evolutionary algorithms. Experimental results demonstrate the promising performance of the proposed algorithm in terms of optimization quality.

1 January 2022 in Discrete Dynamics in Nature and Society
Verified
Journal Article
Open access
PDF file
SWShihua Wang
Shihua Wang
YLYanmin Liu
Yanmin Liu
KZKangge Zou
Kangge Zou
NLNana Li
Nana Li
YWYaowei Wu
Yaowei Wu
Recently, multiobjective particle swarm optimization (MOPSO) has been widely used in science and engineering, however how to effectively improve the convergence and distribution of the algorithm has always been a hot research topic on multiobjective optimization problems (MOPs). To solve this problem, we propose a multiobjective particle swarm optimization based on the ideal distance (IDMOPSO). In IDMOPSO, the adaptive grid and ideal distance are used to optimize and improve the selection method of global learning samples and the size control strategy of the external archive, and the fine‐tuning parameters are introduced to adjust particle flight in the swarm dynamically. Additionally, to prevent the algorithm from falling into a local optimum, the cosine factor is introduced to mutate the position of the particles during the exploitation and exploration process. Finally, IDMOPSO, several other popular MOPSOs and MOEAs were simulated on the benchmarks functions to test the performance of the proposed algorithm using IGD and HV indicators. The experimental results show that IDMOPSO has the better convergence, diversity, and excellent solution ability compared to the other algorithms.

4 January 2012
Verified
Book Chapter
Closed access
PDF file
SWShujun Wang
Shujun Wang
NLNana Li
Nana Li
XMXianrui Meng
Xianrui Meng