Sensitivity-based chance-constrained Generation Expansion Planning

doi:10.1016/j.epsr.2015.05.011

Sensitivity-based chance-constrained Generation Expansion Planning

2015-10-01

24

OA

AI

M

Monishaa Manickavasagam

DOI：10.1016/j.epsr.2015.05.011

原文链接

查看原文

摘要

En 中文

A Generation Expansion Planning problem with load uncertainty is formulated based on joint chance-constrained programming (CCP) and is solved by incorporating sensitivity into iterative algorithms. These algorithms exploit the characteristics of the system and its response to load variations. Sensitivities help to classify buses according to stress level, and sensitivity-based iterative algorithms distinguish each bus based on its contribution to the overall system reliability. The use of sensitivity overcomes some of the mathematical obstacles to solving joint CCP problems and, in addition, leads to optimal expansion solutions because uncertain loads are correctly estimated. The IEEE 30- and 118-bus test systems are used to demonstrate the proposed algorithms, and the results Of these algorithms are compared with those of other algorithms for solving the joint CCP problem. (C) 2015 Elsevier B.V. All rights reserved.

Keyword:

Generation Expansion Planning

Chance-constrained programming

Sensitivity

Sensitivity-based chance-constrained Generation Expansion Planning

摘要

AI总结

期刊

机构