Security constrained transmission expansion planning by accelerated benders decomposition

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.