Abstract

This paper proposes a novel particle swarm optimization (PSO) algorithm with population reduction, which is called modified new self-organizing hierarchical PSO with jumping time-varying acceleration coefficients (MNHPSO-JTVAC). The proposed method is used for solving well-known benchmark functions, as well as non-convex and non-smooth dynamic economic dispatch (DED) problems for a 24 h time interval in two different test systems. Operational constraints including the prohibited operating zones (POZs), the transmission losses, the ramp-rate limits and the valve-point effects are considered in solving the DED problem. The obtained numerical results show that the MNHPSO-JTVAC algorithm is very suitable and competitive compared to other algorithms and have the capacity to obtain better optimal solutions in solving the non-convex and non-smooth DED problems compared to the other variants of PSO and the state of the art optimization algorithms proposed in recent literature. The source codes of the HPSO-TVAC algorithms and supplementary data for this paper are publicly available at https://github.com/ebrahimakbary/MNHPSO-JTVAC.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call