| Title |
Security Constrained Optimal Power Flow by Hybrid Algorithms |
| Authors |
김규호(Kim, Gyu-Ho) ; 이상봉(Lee, Sang-Bong) ; 이재규(Lee, Jae-Gyu) ; 유석구(Yu, Seok-Gu) |
| Keywords |
최적전력조류 ; 안전도제약 ; 진화계획법 ; 순차적 2차계획법 ; 다중목적함수 ; 하이브리드 알고리즘 Optimal Power Flow ; Security Constraint ; Evolutionary Programming ; Sequential Quadratic Programming ; Multi-Objective Function ; Hybrid Algorithms |
| Abstract |
This paper presents a hybrid algorithm for solving optimal power flow(OPF) in order to enhance a systems capability to cope with outages, which is based on combined application of evolutionary computation and local search method. The efficient algorithm combining main advantages of two methods is as follows : Firstly, evolutionary computation is used to perform global exploitation among a population. This gives a good initial point of conventional method. Then, local methods are used to perform local exploitation. The hybrid approach often outperforms either method operating alone and reduces the total computation time. The objective function of the security constrained OPF is the minimization of generation fuel costs and real power losses. The resulting optimal operating point has to be feasible after outages such as any single line outage(respect of voltage magnitude, reactive power generation and power flow limits). In OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The OPF considering security, the outages are selected by contingency ranking method(contingency screening model). The method proposed is applied to IEEE 30 buses system to show its effectiveness. |