1 / 9

Whither dynamic congestion management ?

Whither dynamic congestion management ?. IREP Symposium 2004 Cortina d’Ampezzo (Italy) Louis WEHENKEL – Université de Liège. Outline. The proposal Static congestion management Dynamic congestion management Some arguments in favor of Dynamic CM Immediate vs. delayed actions

cedric
Télécharger la présentation

Whither dynamic congestion management ?

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Whither dynamic congestion management ? IREP Symposium 2004 Cortina d’Ampezzo (Italy) Louis WEHENKEL – Université de Liège

  2. Outline The proposal Static congestion management • Dynamic congestion management Some arguments in favor of Dynamic CM • Immediate vs. delayed actions • Multiple solutions of SCOPF based static CM • Market power, gaming • Sub-optimality of static CM Feasibility and needs for research

  3. Congestion management • Real-time decision making by system operators to • maintain system security above minimum • minimize economic impact • avoid discrimination and market bias • Remarks • time step typically of 15 to 30 minutes • objectives monitored over a longer term

  4. Static CM • Problem formulation At time k, compute decision uk to • satisfy instantaneous security constraints and • minimize instantaneous costs Given xk , select uk in U(xk) to minimize ck(xk, uk) • Notation k : discrete time index (say 15 minutes time step) xk: electrical state vector at time k (estimated) uk: decision variables at time k (to determine) ck(x,u) : instantaneous cost function, U(x) : constraints on decision variables • NB: Constraints U(x) include feasibility and all kinds of security constraints deemed relevant (N, N-1, static, dynamic…)

  5. Dynamic CM • Problem formulation • (Assuming a state transition model : xk+1 = f(xk , uk ,, wk ) ) • At time k, compute a sequence of decisions (uk , uk+1,…, uk+T-1) to • satisfy security constraints and • minimize cost induced over the whole time interval (k, k+T-1) • Remarks • Apply uk and refresh the sequence at the next time step • Time step of 5 to 30 minutes • Time horizon T of several hours to a few days • (and we neglect faster dynamics)

  6. Argument/Question No1 • Dynamic Congestion Management can in principle reach a better security/cost tradeoff (over the long term) than static congestion management Would savings be significant ?

  7. Argument/Question No2 • In dynamic CM one can include constraints and/or penalization terms to • allocate impact on market participants in a non discriminating way (whatever that means…) • fight against gaming and market power What is the impact of this on the overall security/cost tradeoff ?

  8. Computational feasibility ? Try to combine existing model-based tools • SCOPF, DSA, DSE with stochastic optimization and approximation techniques to solve stochastic dynamic programming problem Can be used on-line or off-line

  9. Grazie mille

More Related