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