Dynamic programming approach for solving power generating unit commitment problem

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.