PSO-E: Particle Swarm with Exponential Distribution

Studies with the Gaussian and Cauchy probability distributions have shown that the performance of the standard PSO algorithm can be improved. But these versions may also get stuck in local minima when optimizing functions with many local minima in high dimensional search space. In this paper, we will provide new results with PSO using the Exponential probability distribution aiming at improvement in performance. This version of the algorithm, termed PSO-E, was tested on a suite of well-known benchmark functions with many local optima and the results were compared with those obtained by the standard PSO (constriction factor). Simulation results show the suitability of PSO-E.