Particle swarm optimization (PSO) algorithm has been successfully applied to solve various optimization problems in science and engineering. One such popular one is called global PSO (GPSO) algorithm. One of major drawback of GPSO algorithm is the phenomenon of “zigzagging”, that leads to premature convergence by falling into local minima. In addition, the performance of GPSO algorithm deteriorates for high-dimensional problems, especially in presence of nonlinear constraints. In this paper we propose a novel algorithm called, orthogonal PSO (OPSO) that alleviates the shortcomings of the GPSO algorithm. In OPSO algorithm, the m particles of the swarm are divided into two groups: active group and passive group. The d particles of the active group undergo an orthogonal diagonalization process and are updated in such way that their position vectors become orthogonally diagonalized. In the OPSO algorithm, the particles are updated using only one guide, thus avoiding the conflict between the two guides that occurs in the GPSO algorithm. We applied the OPSO algorithm for solving economic dispatch (ED) problem by taking three power systems under several power constraints imposed by thermal generating units (TGUs) and smart power grid (SPG), for example, ramp rate limits, and prohibited operating zones. In addition, the OPSO algorithm is also applied for ten selected shifted and rotated CEC 2015 benchmark functions. With extensive simulation studies, we have shown superior performance of OPSO algorithm over GPSO algorithm and several existing evolutional computation techniques in terms of several performance measures, e.g., minimum cost, convergence rate, consistency, and stability. In addition, using unpaired t-Test, we have shown the statistical significance of the OPSO algorithm against several contending algorithms including top-ranked CEC 2015 algorithms.
Read full abstract