contingency-constrained optimal power flow using simplex-based chaotic-pso algorithmcontingency-constrained最佳功率流使用simplex-based chaotic-pso算法.pdfVIP

Hindawi Publishing Corporation Applied Computational Intelligence and Soft Computing Volume 2011, Article ID 942672, 13 pages doi:10.1155/2011/942672 Research Article Contingency-Constrained Optimal Power Flow Using Simplex-Based Chaotic-PSO Algorithm Zwe-Lee Gaing and Chia-Hung Lin Department of Electrical Engineering, Kao-Yuan University, Kaohsiung City 821, Taiwan Correspondence should be addressed to Zwe-Lee Gaing, zlgaing@.tw Received 26 September 2010; Revised 18 February 2011; Accepted 25 April 2011 Academic Editor: Chuan-Kang Ting Copyright © 2011 Z.-L. Gaing and C.-H. Lin. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. This paper proposes solving contingency-constrained optimal power flow (CC-OPF) by a simplex-based chaotic particle swarm optimization (SCPSO). The associated objective of CC-OPF with the considered valve-point loading effects of generators is to minimize the total generation cost, to reduce transmission loss, and to improve the bus-voltage profile under normal or postcontingent states. The proposed SCPSO method, which involves the chaotic map and the downhill simplex search, can avoid the premature convergence of PSO and escape local minima. The effectiveness of the proposed method is demonstrated in two power systems with contingency constraints and compared with other stochastic techniques in terms of solution quality and convergence rate. The experimental results show that the SCPSO-based CC-OPF method has suitable mutation schemes, thus showing robustness and effectiveness in solving contingency-constrained OPF problems. 1. Introduction