Compact Particle Swarm Optimization

Abstract

Some real-world optimization problems are plagued by a limited hardware availability. This situation can occur, for example, when the optimization must be performed on a device whose hardware is limited due to cost and space limitations. This paper addresses this class of optimization problems and proposes a novel algorithm, namely compact Particle Swarm Optimization (cPSO). The proposed algorithm employs the search logic typical of Particle Swarm Optimization (PSO) algorithms, but unlike classical PSO algorithms, does not use a swarm of particles and does not store neither the positions nor the velocities. On the contrary, cPSO employs a probabilistic representation of the swarm’s behaviour. This representation allows a modest memory usage for the entire algorithmic functioning, the amount of memory used is the same as what is needed for storing five solutions. A novel interpretation of compact optimization is also given in this paper. Numerical results show that cPSO appears to outperform other modern algorithms of the same category (i.e. which attempt to solve the optimization despite a modest memory usage). In addition, cPSO displays a very good performance with respect to its population-based version and a respectable performance also with respect to some more complex population-based algorithms. A real world application in the field of power engineering and energy generation is given. The presented case study shows how, on a model of an actual power plant, an advanced control system can be online and real-time optimized. In this application example the calculations are embedded directly on the real-time control system.