Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
