Security Constrained Stochastic Multi-objective Optimal Power Dispatch

被引:3
作者
Bath, Sarbjeet Kaur [1 ]
Dhillon, Jaspreet Singh [2 ]
Kothari, D. P. [3 ]
机构
[1] GZS Coll Engn & Technol, Bathinda, Punjab, India
[2] St Longowal Inst Engn & Technol, Sangrur, Punjab, India
[3] IIT, New Delhi, India
来源
INTERNATIONAL JOURNAL OF EMERGING ELECTRIC POWER SYSTEMS | 2007年 / 8卷 / 01期
关键词
decision maker (DM); evolutionary optimization; fuzzy goals; membership function; stochastic multi-objective optimization; weight pattern;
D O I
10.2202/1553-779X.1384
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
A stochastic multi-objective line security constrained problem is formulated to minimize non-commensurable objectives viz. operating cost, polluting gaseous emission and variance of active power generation and reactive power generation, with explicit recognition of statistical uncertainties in the thermal power generation cost coefficients, gaseous emission coefficients, power demands and hence power generations and bus voltages, which are considered random variables. Specific technique is put forth to convert the stochastic models into their respective deterministic equivalents. Fuzzy set theory has been exploited to evaluate the different objectives that are quantified by defining their membership functions. Security of transmission lines with respect to expected active power flow is considered in the form of fuzzy objective function. The solution set of such formulated problems is non-inferior due to contradictions among the objectives undertaken. The weighting method is used to simulate the trade-off relationship between the conflicting objectives in the non-inferior domain. Generally, the weights are either simulated or searched in the non-inferior domain. In the paper Evolutionary search technique is implemented to search the 'preferred' weightage pattern in the non-inferior domain, which corresponds to the 'best' compromised solution. Among the non-inferior solutions, the system operator selects the 'preferred' optimal operating point that provides maximum satisfaction level of the most under achieved objective in terms of membership function and is termed as fitness function. The validity of the proposed method has been demonstrated on an IEEE system comprising of 11-nodes, 17-lines and 5-generators.
引用
收藏
页数:21
相关论文
共 20 条
[1]   Environmental/economic power dispatch using multiobjective evolutionary algorithms [J].
Abido, MA .
IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (04) :1529-1537
[2]   An interactive fuzzy satisfying method based on evolutionary programming technique for multiobjective short-term hydrothermal scheduling [J].
Basu, M .
ELECTRIC POWER SYSTEMS RESEARCH, 2004, 69 (2-3) :277-285
[3]   Fuzzy satisfying multi-objective generation scheduling based on simplex weightage pattern search [J].
Brar, YS ;
Dhillon, JS ;
Kothari, DP .
INTERNATIONAL JOURNAL OF ELECTRICAL POWER & ENERGY SYSTEMS, 2005, 27 (07) :518-527
[4]   A 2-PHASE INTERACTIVE SOLUTION METHOD FOR MULTIPLE-OBJECTIVE PROGRAMMING-PROBLEMS [J].
BUCHANAN, J .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS, 1991, 21 (04) :743-749
[5]   Stochastic multiobjective generation dispatch of combined heat and power systems [J].
Chang, CS ;
Fu, W .
IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 1998, 145 (05) :583-591
[6]  
Deb K., 1995, OPTIMIZATION ENG DES
[7]   The surrogate worth trade-off approach for multiobjective thermal power dispatch problem [J].
Dhillon, JS ;
Kothari, DP .
ELECTRIC POWER SYSTEMS RESEARCH, 2000, 56 (02) :103-110
[8]   STOCHASTIC ECONOMIC EMISSION LOAD DISPATCH [J].
DHILLON, JS ;
PARTI, SC ;
KOTHARI, DP .
ELECTRIC POWER SYSTEMS RESEARCH, 1993, 26 (03) :179-186
[9]   Fuzzy decision-making in stochastic multiobjective short-term hydrothermal scheduling [J].
Dhillon, JS ;
Parti, SC ;
Kothari, DP .
IEE PROCEEDINGS-GENERATION TRANSMISSION AND DISTRIBUTION, 2002, 149 (02) :191-200
[10]   STOCHASTIC OPTIMAL LOAD FLOW USING NEWTON-RAPHSON ITERATIVE TECHNIQUE [J].
ELHAWARY, ME ;
MBAMALU, GAN .
ELECTRIC MACHINES AND POWER SYSTEMS, 1988, 15 (06) :371-380