Dynamic Programming Approach for Large Scale Unit Commitment Problem

Author

Singhal, Prateek Kumar ; Sharma, R. Naresh

Author_Institution

Electr. Eng. Dept., Nat. Inst. of Technol., Hamirpur, India

fYear

2011

fDate

3-5 June 2011

Firstpage

714

Lastpage

717

Abstract

In this paper, the large scale Unit Commitment (UC) problem has been solved using Dynamic Programming (DP) and the test results for conventional DP, Sequential DP and Truncation DP are compared with other stochastic techniques. The commitment is such that the total cost is minimal. The total cost includes both the production cost and the costs associated with start-up and shutdown of units. DP is an optimization technique which gives the optimal solution.

Keywords

dynamic programming; large-scale systems; power generation dispatch; power generation economics; power generation scheduling; stochastic processes; conventional DP; dynamic programming approach; large scale unit commitment problem; optimization technique; production cost; sequential DP; start-up cost; stochastic technique; total cost; truncation DP; Central Processing Unit; Dynamic programming; Generators; Optimization; Production; Schedules; Spinning; binary particle swarm optimization; dynamic programming; evolutionary programming; genetic algorithm; lagrange relaxation; simulated annealing; unit commitment;

fLanguage

English

Publisher

ieee

Conference_Titel

Communication Systems and Network Technologies (CSNT), 2011 International Conference on

Conference_Location

Katra, Jammu

Print_ISBN

978-1-4577-0543-4

Electronic_ISBN

978-0-7695-4437-3

Type

conf

DOI

10.1109/CSNT.2011.152

Filename

5966543