A quantum-inspired approximate dynamic programming algorithm for unit commitment problems considering wind power

2017 ◽  
Author(s):  
Hua Qin ◽  
Hua Wei
Keyword(s):  
Dynamic Programming ◽  
Wind Power ◽  
Approximate Dynamic Programming ◽  
Unit Commitment ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Commitment Problems

An Approximate Dynamic Programming Algorithm for Large-Scale Fleet Management: A Case Application

2009 ◽  
Vol 43 (2) ◽  
pp. 178-197 ◽  
Author(s):  
Hugo P. Simão ◽  
Jeff Day ◽  
Abraham P. George ◽  
Ted Gifford ◽  
John Nienow ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Large Scale ◽  
Approximate Dynamic Programming ◽  
Dynamic Programming Algorithm ◽  
Programming Algorithm ◽  
Fleet Management ◽  
Case Application

A Modified on-Line Rolling Generation Dispatch Model for Accommodating Large-Scale Wind Power

2013 ◽  
Vol 325-326 ◽  
pp. 569-572
Author(s):  
Yin Cheng ◽  
Hai Xin Li ◽  
Jing Wei Liu ◽  
Yan Zhe Xu ◽  
Guo Qiang Sun ◽  
...  
Keyword(s):  
Dynamic Programming ◽  
Wind Power ◽  
Large Scale ◽  
Dynamic Programming Algorithm ◽  
Numerical Results ◽  
Programming Algorithm ◽  
Primal Problem ◽  
On Line ◽  
Dual Relaxation ◽  
Generation Dispatch

This paper proposes an improved strategy for on-line rolling generation dispatch. Based on the framework of Lagrange dual relaxation, the problem is transformed and decomposed into primal-problem and N subproblems multipliers and system constrains are satisfied iteratively. The sub-problems are solved by an efficient dynamic programming algorithm without changing the condition of convergence of the framework. Numerical results indicate that the proposed method is fast and efficient in dealing with numerous system constrains.

Sign in / Sign up

Export Citation Format

Share Document