DocumentCode
2291424
Title
Dynamic programming approach for solving power generating unit commitment problem
Author
Singhal, Prateek Kumar ; Sharma, R. Naresh
Author_Institution
Electr. Eng. Dept., Nat. Inst. of Technol., Hamirpur, India
fYear
2011
fDate
15-17 Sept. 2011
Firstpage
298
Lastpage
303
Abstract
In this paper, a large scale Unit Commitment (UC) problem has been solved using Conventional dynamic programming (CDP), Sequential dynamic programming (SDP) and Truncation dynamic programming (TDP) without time constraints and the results show the comparison of production cost and CPU time. The UC provides an approach to decrease the cost and improve reliability of the network. The UC is a dynamic process, and the generation plan is always changing according to different load and network topology.
Keywords
dynamic programming; power generation dispatch; power generation scheduling; conventional dynamic programming; dynamic programming approach; power generating unit commitment problem; sequential dynamic programming; truncation dynamic programming; Communications technology; Computers; Dynamic programming; Production; Schedules; Spinning; Trajectory; Unit Commitment; dynamic programming; economic dispatch; optimization; production cost; start-up cost;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer and Communication Technology (ICCCT), 2011 2nd International Conference on
Conference_Location
Allahabad
Print_ISBN
978-1-4577-1385-9
Type
conf
DOI
10.1109/ICCCT.2011.6075161
Filename
6075161
Link To Document