Metropolis Particle Swarm Optimization Algorithm with Mutation Operator For Global Optimization Problems

International audienceWhen a local optimal solution is reached with classical Particle Swarm Optimization (PSO), all particles in the swarm gather around it, and escaping from this local optima becomes difficult. To avoid premature convergence of PSO, we present in this paper a novel variant of PSO algorithm, called MPSOM, that uses Metropolis equation to update local best solutions (lbest) of each particle and uses mutation operator to escape from local optima. The proposed MPSOM algorithm is validated on seven standard benchmark functions and used to solve the problem of reducing memory energy consumption in embedded systems (Scratch-Pad Memories SPMs). The numerical results show that our approach outperforms several recently published algorithms