Author(s)

Danli Long^*, Hua Wei

Guangxi key Laboratory of Power System Optimization and Energy Technology, Guangxi University, Nanning, China.

Considering the economics and securities for the operation of a power system, this paper presents a new adaptive dynamic programming approach for security-constrained unit commitment (SCUC) problems. In response to the “curse of dimension” problem of dynamic programming, the approach solves the Bellman’s equation of SCUC approximately by solving a sequence of simplified single stage optimization problems. An extended sequential truncation technique is proposed to explore the state space of the approach, which is superior to traditional sequential truncation in daily cost for unit commitment. Different test cases from 30 to 300 buses over a 24 h horizon are analyzed. Extensive numerical comparisons show that the proposed approach is capable of obtaining the optimal unit commitment schedules without any network and bus voltage violations, and minimizing the operation cost as well.

Power System Operation and Planning; Priority Order; Adaptive Dynamic Programming; Unit Commitment

Long, D. and Wei, H. (2014) Extended Sequential Truncation Technique for Adaptive Dynamic Programming Based Security-Constrained Unit Commitment with Optimal Power Flow Constraints. Journal of Power and Energy Engineering, 2, 687-693. doi: 10.4236/jpee.2014.24092.