1982
DOI: 10.1109/mper.1982.5519489
|View full text |Cite
|
Sign up to set email alerts
|

Layered Network Model Approach to Optimal Daily Hydro Scheduling

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

1993
1993
2015
2015

Publication Types

Select...
4

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(4 citation statements)
references
References 0 publications
0
4
0
Order By: Relevance
“…The weight of an edge between vertices u and v is denoted by c uv or w(u,v), a flow from s to t is denoted by f st . A layered network (LN) [16] is such a network with following characters:…”
Section: B the Establish Of Optimal Process Model Of Rtpmentioning
confidence: 99%
“…The weight of an edge between vertices u and v is denoted by c uv or w(u,v), a flow from s to t is denoted by f st . A layered network (LN) [16] is such a network with following characters:…”
Section: B the Establish Of Optimal Process Model Of Rtpmentioning
confidence: 99%
“…subject to all constraints related to the hydro system (5)- (7). An innovative incremental network flow programming is introduced to solve the hydro subproblem.…”
Section: Hydro Subproblemmentioning
confidence: 99%
“…Unfortunately, DP is unsuitable for Hydro Electric Commission (HEC) optimal hydro scheduling problems in multi-reservoir systems because of high computational requirements and the difficulty of incorporating coupling constraints between reservoirs (Piekutowski et al, 1994). Some other approaches utilizing decomposing or layering are also proposed for multi-reservoir systems (Saad et al, 1996;Wakamori et al, 1982), while unit scheduling is still not taken into account for the purpose of dimensionality reduction.…”
Section: Introductionmentioning
confidence: 99%