TY - JOUR
T1 - Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation
AU - Wang, S. J.
AU - Shahidehpour, S. M.
AU - Kirschen, D. S.
AU - Mokhtari, S.
AU - Irisarri, G. D.
PY - 1995/8
Y1 - 1995/8
N2 - 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.
AB - 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.
U2 - 10.1109/59.466524
DO - 10.1109/59.466524
M3 - Article
SN - 0885-8950
VL - 10
SP - 1294
EP - 1301
JO - IEEE Transactions on Power Systems
JF - IEEE Transactions on Power Systems
IS - 3
ER -