Security Constrained Optimal Power Flow Using Self-Organizing Hierarchical PSO with Time-Varying Acceleration Coefficients
- Corresponding Author:
- Dieu Vo Ngoc
Department of Power Systems Engineering
Ho Chi Minh City University of Technology
VNU-HCM, HCM City, Vietnam
E-mail: [email protected]
Received date: September 15, 2014; Accepted date: September 19, 2014; Published date: September 29, 2014
Citation: Polprasert J, Ongsakul W, Ngoc DV (2014) Security Constrained Optimal Power Flow Using Self-Organizing Hierarchical PSO with Time-Varying Acceleration Coefficients. Global J Technol Optim 5:163. doi:10.4172/2229-8711.1000163
Copyright: © 2014 Polprasert J, et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
This paper proposes a self-organizing hierarchical particle swarm optimization (SOHPSO) with time-varying acceleration coefficients (TVAC) for solving security constrained optimal power flow (SCOPF) problem. The SCOPF is to minimize a total generation cost while satisfying generator operational constraints and network security constraints in which the minimum severity index is used to alleviate line loading. The proposed SOHPSO-TVAC re-initializes particle velocities whenever the population stagnates at local optima during the search and TVAC is used to enhance convergence to the global optimum solution. Test results on the IEEE 30 and 118 bus systems indicate that the proposed SCOPF renders a lower total generation cost in a faster convergence rate than the other heuristic methods, which is favorable for online implementation.