Year: 2022
Type: conference-paper
Abstract: In view of the drawbacks of the conventional particle swarm optimization algorithm, such as the ease of falling into local extreme values, poorer diversity, and slower convergence speed in subsequent optimization, a dynamic mutation particle swarm optimization algorithm (DMPSO) is proposed. On the basis of the characteristics of the particle swarm optimization algorithm, such as a fast convergence speed and simple mechanism, the mutation mechanism of the genetic algorithm is introduced. We redesigned the dynamic inertia weight and mutation rate, and we added a ratio adjustment formula for speed, which accelerates the convergence speed of the algorithm and improves its optimization performance. In an experiment, six benchmark functions were selected for an optimization test, and the results show that the proposed method has a faster convergence speed and better optimization performance.
Authors: Yang Zhang, Jiacheng Li, Lei Li
Institutions: Hosei University, Kanagawa University
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W4306952720
