Parameter Adaptation and Criticality in Particle Swarm Optimization
Carlos Garcia Cordero

TL;DR
This paper introduces an Adaptive Particle Swarm Optimization algorithm leveraging self-organized criticality to reduce parameter tuning, demonstrating improved exploration-exploitation balance and long-term performance over standard PSO.
Contribution
The paper develops a novel Adaptive PSO with self-organized criticality and provides a dedicated software platform for real-time experimentation and parameter tuning.
Findings
Adaptive PSO avoids stagnation and maintains criticality.
Enhanced exploration and exploitation balance.
Superior long-term optimization performance.
Abstract
Generality is one of the main advantages of heuristic algorithms, as such, multiple parameters are exposed to the user with the objective of allowing them to shape the algorithms to their specific needs. Parameter selection, therefore, becomes an intrinsic problem of every heuristic algorithm. Selecting good parameter values relies not only on knowledge related to the problem at hand, but to the algorithms themselves. This research explores the usage of self-organized criticality to reduce user interaction in the process of selecting suitable parameters for particle swarm optimization (PSO) heuristics. A particle swarm variant (named Adaptive PSO) with self-organized criticality is developed and benchmarked against the standard PSO. Criticality is observed in the dynamic behaviour of this swarm and excellent results are observed in the long run. In contrast with the standard PSO, the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMetaheuristic Optimization Algorithms Research · Evolutionary Algorithms and Applications · Advanced Multi-Objective Optimization Algorithms
