Sensitivity-based chance-constrained Generation Expansion Planning

作     者：Manickavasagam, Monishaa Anjos, Miguel F. Rosehart, William D. 

作者机构：Univ Calgary Dept Elect & Comp Engn Calgary AB Canada Ecole Hautes Etud Commerciales Gerad Montreal PQ Canada Ecole Polytech Montreal PQ H3C 3A7 Canada 

出 版 物：《ELECTRIC POWER SYSTEMS RESEARCH》 (电力系统研究)

年 卷 期：2015年第127卷第Oct.期

页      面：32-40页

核心收录：

学科分类：0808[工学-电气工程] 080802[工学-电力系统及其自动化] 08[工学] 

基　　金：Natural Sciences and Engineering Research Council (NSERC) of Canada 

主　　题：Generation Expansion Planning Chance-constrained programming Sensitivity 

摘      要：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.