Deep Neural Network-guided PSO for Tracking a Global Optimal Position in Complex Dynamic Environment

2026-04-15Neural and Evolutionary Computing

Neural and Evolutionary Computing
AI summary

The authors developed new types of particle swarm optimization (PSO) that use deep neural networks (DNNs) to help particles find the best solutions in changing environments. Traditional PSO struggles when the best solution moves over time and often needs many particles to work well. Their methods let particles learn and predict how the environment changes, so fewer particles can better follow the moving best solutions. They tested two versions—one with a shared network and one with individual networks—and both tracked changing optima more accurately than recent methods.

Particle Swarm OptimizationDeep Neural NetworksDynamic EnvironmentsOptimizationGlobal OptimumSwarm IntelligenceTrackingHeuristic AlgorithmsSub-populationRe-diversification
Authors
Stephen Raharja, Toshiharu Sugawara
Abstract
We propose novel particle swarm optimization (PSO) variants incorporated with deep neural networks (DNNs) for particles to pursue globally optimal positions in dynamic environments. PSO is a heuristic approach for solving complex optimization problems. However, canonical PSO and its variants struggle to adapt efficiently to dynamic environments, in which the global optimum moves over time, and to track them accurately. Many PSO algorithms improve convergence by increasing the swarm size beyond potential optima, which are global/local optima but are not identified until they are discovered. Additionally, in dynamic environments, several methods use multiple sub-population and re-diversification mechanisms to address outdated memory and local optima entrapment. To track the global optimum in dynamic environments with smaller swarm sizes, the DNNs in our methods determine particle movement by learning environmental characteristics and adapting dynamics to pursue moving optimal positions. This enables particles to adapt to environmental changes and predict the moving optima. We propose two variants: a swarm with a centralized network and distributed networks for all particles. Our experimental results show that both variants can track moving potential optima with lower cumulative tracking error than those of several recent PSO-based algorithms, with fewer particles than potential optima.