Yanmin Liu

Yanmin Liu


Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
22 December 2022 in Journal of Computational Design and Engineering
Verified
Journal Article
Open access
PDF file
XSXiaoli Shu
Xiaoli Shu
YLYanmin Liu
Yanmin Liu
JLJun Liu
Jun Liu
MYMeilan Yang
Meilan Yang
QZQian Zhang
Qian Zhang
There are many complex multi-objective optimization problems in the real world, which are difficult to solve using traditional optimization methods. Multi-objective particle swarm optimization is one of the effective algorithms to solve such problems. This paper proposes a multi-objective particle swarm optimization with dynamic population size (D-MOPSO), which helps to compensate for the lack of convergence and diversity brought by particle swarm optimization, and makes full use of the existing resources in the search process. In D-MOPSO, population size increases or decreases depending on the resources in the archive, thereby regulating population size. On the one hand, particles are added according to local perturbations to improve particle exploration. On the other hand, the non-dominated sorting and population density are used to control the population size to prevent the excessive growth of population size. Finally, the algorithm is compared with 13 competing multi-objective optimization algorithms on four series of benchmark problems. The results show that the proposed algorithm has advantages in solving different benchmark problems.

8 January 2025 in International Journal of Computational Intelligence Systems
Verified
Journal Article
Open access
PDF file
YZYansong Zhang
Yansong Zhang
YLYanmin Liu
Yanmin Liu
XZXiaoyan Zhang
Xiaoyan Zhang
QSQian Song
Qian Song
AOAijia Ouyang
Aijia Ouyang
JYJie Yang
Jie Yang
The multi-objective particle swarm optimization (MOPSO) is an optimization technique that mimics the foraging behavior of birds to solve difficult optimization problems. MOPSO is well known for its strong global search capability, which efficiently locates solutions that are close to the global optimum across a wide search domain. However, similar to many other optimization algorithms, the fast convergence property of MOPSO can occasionally lead to the population entering the local optimum too soon, obstructing researchers from investigating more efficient solutions. To address this challenge, the study proposes a novel framework that integrates the fireworks algorithm (FA) into MOPSO and establishes a size-double archiving mechanism to maintain population diversity. By preventing population homogenization, this mechanism promotes the retention of better solutions. Additionally, by fusing evolutionary data analysis with particle information, the study offers new individual optimal choices and adaptive parameter tuning to improve the algorithm’s robustness and adaptability and better manage the complexity of multi-objective optimization problems (MOPs). The suggested algorithm is compared with several existing MOPSOs and multi-objective evolutionary algorithms (MOEAs) in simulation experiments. Standard test problems like ZDT, UF, and DTLZ are used in the experiments. The new algorithm performs exceptionally well in terms of improving convergence and population diversity, as well as demonstrating significant competitiveness for solving MOPs.

8 July 2023 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
JLJun Liu
Jun Liu
YLYanmin Liu
Yanmin Liu
HHHuayao Han
Huayao Han
XZXianzi Zhang
Xianzi Zhang
XSXiaoli Shu
Xiaoli Shu
FCFei Chen
Fei Chen
In multi-objective particle swarm optimization, it is very important to select the personal best and the global best. These leaders are expected to effectively guide the population toward the true Pareto front. In this paper, we propose a two-stage maintenance and multi-strategy selection for multi-objective particle swarm optimization (TMMOPSO), which adaptively selects the global best and updates the personal best by means of hyper-cone domain and aggregation, respectively. This strategy enhances the global exploration and local exploitation abilities of the population. In addition, the excellent particles are perturbed and a two-stage maintenance strategy is used for the external archive. This strategy not only improves the quality of the solutions in the population but also accelerates the convergence speed of the population. In this paper, the proposed algorithm is compared with several multi-objective optimization algorithms on 29 benchmark problems. The experimental results show that TMMOPSO is effective and outperforms the comparison algorithms on most of the 29 benchmark problems.

29 August 2017 in IEEE/ACM Transactions on Computational Biology and Bioinformatics
Verified
Journal Article
Closed access
Ben NiuBen Niu
Ben Niu
JLJing Liu
Jing Liu
TWTeresa Wu
Teresa Wu
XCXianghua Chu
Xianghua Chu
ZWZhengxu Wang
Zhengxu Wang
YLYanmin Liu
Yanmin Liu
This paper presents a Coevolutionary Structure-Redesigned-Based Bacteria Foraging Optimization (CSRBFO) based on the natural phenomenon that most living creatures tend to cooperate with each other so as to fulfill tasks more effectively. Aiming at lowering computational complexity while maintaining the critical search capability of standard bacterial foraging optimization (BFO), we employ a general loop to replace the nested loop and eliminate the reproduction step of BFO. Hence, the proposed CSRBFO only consists of two main steps: (1) chemotaxis and (2) elimination & dispersal. A coevolutionary strategy by which all bacteria can learn from each other and search for optima cooperatively is incorporated into the chemotactic step to accelerate convergence and facilitate accurate search. In the elimination & dispersal step, the three-stage evolutionary strategy with different learning methods for maintaining diversity is studied. An evaluation of the convergence status is then added to determine whether bacteria should move on to the next stage or not. The combination of coevolutionary strategy and convergence status evaluation is expected to balance exploration and exploitation. Experimental results comparing seven well-known heuristic algorithms on 24 benchmark functions demonstrate that the proposed CSRBFO outperforms the comparison algorithms significantly in most of the cases.

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.

16 May 2024 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
FCFei Chen
Fei Chen
YLYanmin Liu
Yanmin Liu
JYJie Yang
Jie Yang
JLJun Liu
Jun Liu
XZXianzi Zhang
Xianzi Zhang
To counterbalance the abilities of global exploration and local exploitation of algorithm and enhance its comprehensive performance, a multi-objective particle swarm optimization with a competitive hybrid learning strategy (CHLMOPSO) is put forward. With regards to this, the paper first puts forward a derivative treatment strategy of personal best to promote the optimization ability of particles. Next, an adaptive flight parameter adjustment strategy is designed in accordance with the evolutionary state of particles to equilibrate the exploitation and exploration abilities of the algorithm. Additionally, a competitive hybrid learning strategy is presented. According to the outcomes of the competition, various particles decide on various updating strategies. Finally, an optimal angle distance strategy is proposed to maintain archive effectively. CHLMOPSO is compared with other algorithms through simulation experiments on 22 benchmark problems. The results demonstrate that CHLMOPSO has satisfactory performance.