Improved particle swarm optimization and applications to Hidden Markov Model and Ackley function

Abstract

Particle Swarm Optimization (PSO) is an algorithm based on social intelligence, utilized in many fields of optimization. In applications like speech recognition, due to existence of high dimensional matrices, the speed of standard PSO is very low. In addition, PSO may be trapped in a local optimum. In this paper, we introduce a novel algorithm that is faster and generates superior results than the standard PSO. Also, the probability of being trapped in a local optimum is decreased. To illustrate advantages of the proposed algorithm, we use it to train a Hidden Markov Model (HMM) and find the minimum of the Ackley function.