Fifth International Conference on Power System Management and Control 2002
DOI: 10.1049/cp:20020030
|View full text |Cite
|
Sign up to set email alerts
|

Economically optimised power dispatch in local systems using evolutionary algorithms and dynamic programming

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2009
2009
2020
2020

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 4 publications
0
1
0
Order By: Relevance
“…To maximize utility in expectation, we employed dynamic programming [Bellman, 1957], a technique that solves complex stochastic optimization problems by breaking them into simpler, solvable subproblems [Dasgupta et al, 2006]. Dynamic programming has been used to solve decision problems under weather uncertainty in fields including power dispatch [Hable et al, 2002], irrigation [Wilks and Wolfe, 1998], and air traffic management [Nilim et al, 2001]. Using dynamic programming, the implications of any flight decision can be broken into two parts: the implications for today and the implications for the rest of the experiment [Hanlon et al, 2013].…”
Section: Optimization Modulementioning
confidence: 99%
“…To maximize utility in expectation, we employed dynamic programming [Bellman, 1957], a technique that solves complex stochastic optimization problems by breaking them into simpler, solvable subproblems [Dasgupta et al, 2006]. Dynamic programming has been used to solve decision problems under weather uncertainty in fields including power dispatch [Hable et al, 2002], irrigation [Wilks and Wolfe, 1998], and air traffic management [Nilim et al, 2001]. Using dynamic programming, the implications of any flight decision can be broken into two parts: the implications for today and the implications for the rest of the experiment [Hanlon et al, 2013].…”
Section: Optimization Modulementioning
confidence: 99%