1995
DOI: 10.1109/59.466524
|View full text |Cite
|
Sign up to set email alerts
|

Short-term generation scheduling with transmission and environmental constraints using an augmented Lagrangian relaxation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
159
0

Year Published

1999
1999
2021
2021

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 465 publications
(167 citation statements)
references
References 19 publications
0
159
0
Order By: Relevance
“…The proposed method has been implemented to solve a modified IEEE 24-bus system (5) comprising 26 generating units as shown in Fig. 4.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…The proposed method has been implemented to solve a modified IEEE 24-bus system (5) comprising 26 generating units as shown in Fig. 4.…”
Section: Numerical Resultsmentioning
confidence: 99%
“…These include deterministic, meta-heuristic, and hybrid approaches. Deterministic approaches include the priority list method [4], dynamic programming [5], Lagrangian Relaxation (LR) [6], integer/mixed-integer programming [7], [8], and the branch-andbound methods [9]. Due to the mixed binary and continuous variable nature, of the short term scheduling problem traditional optimization techniques may miss the optimal solution.…”
Section: Unmanaged Short-term Scheduling Of Fcppsmentioning
confidence: 99%
“…where is the number of buses; is the number of transmission lines; referring to [17] is power transfer distribution factor of bus to line ; ∧ , ∧ , and ∧ represent the generator , wind farm , and load connected to bus , respectively; + and − are the maximum positive and negative power flows of line during period ; w,3 and w,4 are the decision variables of power output of wind farm under the worst-case scenario for the positive and negative transmission flow constraint;…”
Section: Transmission Flow Constraintsmentioning
confidence: 99%
“…where (23) is the objective function of the upper model, where x is the column vector of decision variables composed of the discrete variables , , and , y is the column vector of decision variables composed of the continuous variables , (5) and (7)- (8), Hy ≤ h represents (16), (17), and (22), Ax + By ≤ m represents (3), (9), (18), and (19), Ix + Jy = n represents (2); the extremal problem min y (Cx + Dy) = Ky of the lower model represents (10), (12), (14), and (15), min y (Mx + Ny) ≥ k represents (10)- (13), (20), and (21), F, E, H, A, B, I, J, C, D, K, G, M, N, and Q are the coefficient matrixes, and f, e, h, m, n, v, g, and q are the coefficient column vectors.…”
Section: Construction Of a Single-level And Two-stage Robustmentioning
confidence: 99%