Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning
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 possibl...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2022-01-01
|
| Series: | International Transactions on Electrical Energy Systems |
| Online Access: | http://dx.doi.org/10.1155/2022/6289475 |
| _version_ | 1811182400565149696 |
|---|---|
| author | Edimar José de Oliveira Arthur Neves de Paula Leonardo Willer de Oliveira Leonardo de Mello Honório |
| author_facet | Edimar José de Oliveira Arthur Neves de Paula Leonardo Willer de Oliveira Leonardo de Mello Honório |
| author_sort | Edimar José de Oliveira |
| collection | DOAJ |
| description | 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. |
| first_indexed | 2024-04-11T09:31:55Z |
| format | Article |
| id | doaj.art-1ac854a76f9e481abc88779048c7605d |
| institution | Directory Open Access Journal |
| issn | 2050-7038 |
| language | English |
| last_indexed | 2024-04-11T09:31:55Z |
| publishDate | 2022-01-01 |
| publisher | Hindawi-Wiley |
| record_format | Article |
| series | International Transactions on Electrical Energy Systems |
| spelling | doaj.art-1ac854a76f9e481abc88779048c7605d2022-12-22T04:31:50ZengHindawi-WileyInternational Transactions on Electrical Energy Systems2050-70382022-01-01202210.1155/2022/6289475Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-PlanningEdimar José de Oliveira0Arthur Neves de Paula1Leonardo Willer de Oliveira2Leonardo de Mello Honório3Department of EnergyDepartment of EnergyDepartment of EnergyDepartment of EnergyThis 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.http://dx.doi.org/10.1155/2022/6289475 |
| spellingShingle | Edimar José de Oliveira Arthur Neves de Paula Leonardo Willer de Oliveira Leonardo de Mello Honório Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning International Transactions on Electrical Energy Systems |
| title | Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning |
| title_full | Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning |
| title_fullStr | Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning |
| title_full_unstemmed | Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning |
| title_short | Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning |
| title_sort | block based multicut benders decomposition algorithm for transmission and energy storage co planning |
| url | http://dx.doi.org/10.1155/2022/6289475 |
| work_keys_str_mv | AT edimarjosedeoliveira blockbasedmulticutbendersdecompositionalgorithmfortransmissionandenergystoragecoplanning AT arthurnevesdepaula blockbasedmulticutbendersdecompositionalgorithmfortransmissionandenergystoragecoplanning AT leonardowillerdeoliveira blockbasedmulticutbendersdecompositionalgorithmfortransmissionandenergystoragecoplanning AT leonardodemellohonorio blockbasedmulticutbendersdecompositionalgorithmfortransmissionandenergystoragecoplanning |