Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning

Abstract

This study proposes a block-based multicut Benders decomposition algorithm to solve the co-planning of transmission expansion and energy storage problem in a bi-level approach. The proposal breaks the chronological representative period into multiple subperiods blocks. This division makes it possible to use parallel computation methods to solve each block simultaneously, reducing the simulation time, which allows the use of a more extensive time window to model the variability of random variables of the system, such as wind and load. In the proposed algorithm, the master problem defines the State of Charge (SoC) of the energy storage devices between the blocks and the investment in transmission and energy storage devices. To demonstrate the effectiveness of the proposed method, different sizes of representative periods are evaluated in three test systems: Garver 6-bus, IEEE-RTS 24-bus, and IEEE-118 188-bus. The tests compare the performance of the proposed block-based multicut Benders decomposition algorithm with the usual approach applied in the literature considering Benders decomposition and the complete problem formulated as a Mixed-Integer Linear Programming (MILP) problem.