Journal Article10.1109/TEVC.2021.3102863
PSO-X: A Component-Based Framework for the Automatic Design of Particle Swarm Optimization Algorithms
55
TL;DR: This article develops a flexible software framework for PSO, called PSO-X, which is specifically designed to integrate the use of automatic configuration tools into the process of generating PSO algorithms, and uses irace, a state-of-the-art configuration tool, to automatize the task of selecting and configuringPSO algorithms starting from these components.
read more
Abstract: The particle swarm optimization (PSO) algorithm has been the object of many studies and modifications for more than twentyfive years. Ranging from small refinements to the incorporation of sophisticated novel ideas, the majority of modifications proposed to this algorithm have been the result of a manual process in which developers try new designs based on their own knowledge and expertise. However, manually introducing changes is very time consuming and makes the systematic exploration of all the possible algorithm configurations a difficult process. In this paper, we propose to use automatic design to overcome the limitations of having to manually find performing PSO algorithms. We develop a flexible software framework for PSO, called PSO-X, which is specifically designed to integrate the use of automatic configuration tools into the process of generating PSO algorithms. Our framework embodies a large number of algorithm components developed over more than twentyfive years of research that have allowed PSO to deal with a large variety of problems, and uses irace, a state-of-the-art configuration tool, to automatize the task of selecting and configuring PSO algorithms starting from these components. We show that irace is capable of finding high performing instances of PSO algorithms never proposed before.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Particle Swarm Optimization or Differential Evolution - A comparison
TL;DR: In this paper , the authors compared the performance of particle swarm optimization and differential evolution algorithms on several single-objective numerical benchmarks and 22 real-world problems, and concluded that on average Differential Evolution algorithms clearly outperform Particle Swarm Optimization ones.
48
Evolutionary Algorithms for Parameter Optimization—Thirty Years Later
Th. Bäck,Anna V. Kononova,Bas van Stein,Hao Wang,Roman Kalkreuth,J. de Nobel,Diederick Vermetten,Roy de Winter,Furong Ye +8 more
TL;DR: In this article , the authors address some major developments in the field of evolutionary algorithms, with applications in parameter optimization, over these 30 years, including covariance matrix adaptation evolution strategy and some fast-growing fields such as multimodal optimization, surrogate-assisted optimization, multiobjective optimization, and automated algorithm design.
42
Two-Stream Graph Convolutional Network-Incorporated Latent Feature Analysis
Fanghui Bi,Tiantian He,Xin Luo +2 more
TL;DR: Wang et al. as discussed by the authors presented a novel approach, dubbed as TGLFA, which constructs a multilayer fully-connected network to capture the attribute characteristics representing the nonlinear latent features of service, where the light graph convolutional network is adopted to acquire the high-order connectivity in QoS data.
33
A Dimension Group-Based Comprehensive Elite Learning Swarm Optimizer for Large-Scale Optimization
TL;DR: A dimension group-based comprehensive elite learning swarm optimizer (DGCELSO) by integrating valuable evolutionary information in different elite particles in the swarm to guide the updating of inferior ones to solve high-dimensional optimization problems.
23
Proximal Alternating-Direction-Method-of-Multipliers-Incorporated Nonnegative Latent Factor Analysis
TL;DR: Wang et al. as mentioned in this paper proposed a proximal alternating-direction-method-of-multipliers-based nonnegative latent factor analysis (PAN) model with two-fold ideas: 1) adopting the principle of alternating direction-method of multipliers to implement an efficient learning scheme for fast convergence and high computational efficiency; and 2) incorporating the proximal regularization into the learning scheme to suppress the optimization fluctuation for high representation learning accuracy to HDI data.
15
References
Particle swarm optimization
TL;DR: A snapshot of particle swarming from the authors’ perspective, including variations in the algorithm, current and ongoing research, applications and open problems, is included.
A new optimizer using particle swarm theory
Russell C. Eberhart,James Kennedy +1 more
- 04 Oct 1995
TL;DR: The optimization of nonlinear functions using particle swarm methodology is described and implementations of two paradigms are discussed and compared, including a recently developed locally oriented paradigm.
16.4K
A modified particle swarm optimizer
Yuhui Shi,Russell C. Eberhart +1 more
- 04 May 1998
TL;DR: A new parameter, called inertia weight, is introduced into the original particle swarm optimizer, which resembles a school of flying birds since it adjusts its flying according to its own flying experience and its companions' flying experience.
11K
The particle swarm - explosion, stability, and convergence in a multidimensional complex space
M. Clerc,James Kennedy +1 more
TL;DR: This paper analyzes a particle's trajectory as it moves in discrete time, then progresses to the view of it in continuous time, leading to a generalized model of the algorithm, containing a set of coefficients to control the system's convergence tendencies.
9.3K
Comparing inertia weights and constriction factors in particle swarm optimization
Russell C. Eberhart,Yuhui Shi +1 more
- 16 Jul 2000
TL;DR: It is concluded that the best approach is to use the constriction factor while limiting the maximum velocity Vmax to the dynamic range of the variable Xmax on each dimension.
3.3K