Abstract
This paper formulates the security constrained transmission expansion planning (SCTEP) into a standard two-stage stochastic programming (SP) problem with complete recourse, which is then tackled by Benders decomposition (BD) due to its special decomposable structure, additionally, three improvements are also employed to accelerate the classical BD: valid inequality, multicut strategy, and optimal precondition. The performance of the improved BD is demonstrated by massively case studies on three classical benchmarks: the Garver 6-bus system, the IEEE 24-bus system, and the IEEE 118-bus system. Significant reduction in both execution time and the number of iterations are achieved for all acceleration strategies.
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.
