SHORT-TERM GENERATION SCHEDULING WITH TRANSMISSION AND ENVIRONMENTAL CONSTRAINTS USING AN AUGMENTED LAGRANGIAN-RELAXATION

被引:383
作者
WANG, SJ [1 ]
SHAHIDEHPOUR, SM [1 ]
KIRSCHEN, DS [1 ]
MOKHTARI, S [1 ]
IRISARRI, GD [1 ]
机构
[1] SIEMENS ENERGY & AUTOMAT INC, DIV EMPROS POWER SYST CONTROL, PLYMOUTH, MN 55441 USA
关键词
POWER SYSTEM OPERATION; UNIT COMMITMENT; ECONOMIC DISPATCH; AUGMENTED LAGRANGIAN RELAXATION; DECOMPOSITION AND COORDINATION;
D O I
10.1109/59.466524
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper proposes a new approach based on augmented Lagrangian relaxation for short term generation scheduling problem with transmission and environmental constraints. In this method, the system constraints, e.g. load demand, spinning reserve, transmission capacity and environmental constraints, are relaxed by using Lagrangian multipliers, and quadratic penalty terms associated with system load demand balance are added to the Lagrangian objective function. Then the decomposition and coordination technique is used, and non-separable quadratic penalty terms are replaced by linearization around the solution obtained from the previous iteration. In order to improve the convergence property, the exactly convex quadratic terms of decision variables are added to the objective function as strongly convex, differentiable and separable auxiliary functions. The overall problem is decomposed into N subproblems, multipliers and penalty coefficients are updated in the dual problem and system constraints are satisfied iteratively. The corresponding unit commitment subproblems are solved by dynamic programming, and the economic dispatch with transmission and environmental constraints is solved by an efficient network flow programming algorithm. The augmented Lagrangian relaxation method enhanced by decomposition and coordination technique avoids oscillations associated with piece-wise linear cost functions. Numerical results indicate that the proposed approach is fast and efficient in dealing with numerous system constraints.
引用
收藏
页码:1294 / 1301
页数:8
相关论文
共 24 条
[1]   FURTHER DEVELOPMENTS IN LP-BASED OPTIMAL POWER FLOW [J].
ALSAC, O ;
BRIGHT, J ;
PRAIS, M ;
STOTT, B .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1990, 5 (03) :697-711
[2]  
[Anonymous], 1979, IEEE T POWER AP SYST, V98, P2047, DOI 10.1109/TPAS.1979.319398
[3]   DAILY GENERATION SCHEDULING OPTIMIZATION WITH TRANSMISSION CONSTRAINTS - A NEW CLASS OF ALGORITHMS [J].
BATUT, J ;
RENAUD, A .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1992, 7 (03) :982-989
[4]  
BATUT J, 1990, 10TH P POW SYST COMP
[5]  
Bertsekas D.P., 1991, LINEAR NETWORK OPTIM
[6]  
Bertsekas D. P., 1982, CONSTRAINED OPTIMIZA
[7]   OPTIMAL ACTIVE POWER DISPATCH BY NETWORK FLOW APPROACH [J].
CARVALHO, MF ;
SOARES, S ;
OHISHI, T .
IEEE TRANSACTIONS ON POWER SYSTEMS, 1988, 3 (04) :1640-1647
[8]   PRIMAL ALGORITHM FOR SOLVING A CAPACITATED NETWORK FLOW PROBLEM WITH ADDITIONAL LINEAR CONSTRAINTS [J].
CHEN, S ;
SAIGAL, R .
NETWORKS, 1977, 7 (01) :59-79
[9]  
Cohen G, 1984, ADV LARGE SCALE SYST, VI, P203
[10]  
Dantzig G. B., 1967, J COMPUTER SYSTEM SC, V1, P213, DOI [DOI 10.1016/S0022-0000%2867%2980015-1, 10.1016/S0022-0000%2867%2980015-1]