A Novel Framework for Co-Expansion Planning of Transmission Lines and Energy Storage Devices Considering Unit Commitment

Abstract

This paper presents a methodology for the co-expansion planning of transmission lines and energy storage systems, considering unit commitment constraints and uncertainties in load demand and wind generation. The problem is formulated as a mixed-integer nonlinear program and solved using a decomposition-based approach that combines a genetic algorithm with mixed-integer linear programming. Uncertainties are modeled through representative day scenarios obtained via clustering. The methodology is validated on a modified IEEE 24-bus system. The results show that co-planning reduces total expansion costs by 14.69%, annual operating costs by 26.19%, and wind curtailment by 91.99% compared to transmission only expansion. These improvements are due to the flexibility introduced by energy storage systems, which enables more efficient thermal dispatch, reduces fuel consumption, and minimizes renewable energy curtailment.

1. Introduction

Transmission Network Expansion Planning (TNEP) is a fundamental aspect of power system planning that determines where, when, and how many new transmission lines should be added to the network. The objective is to minimize investment and operational costs while satisfying technical, economic, and reliability constraints. TNEP must ensure adequate transmission capacity to deliver secure and reliable electric power to the load centers along the planning horizon.

The increasing integration of non-dispatchable renewable energy sources, such as wind and solar power, coupled with the urgency to reduce greenhouse gas emissions, has intensified efforts to mitigate renewable energy curtailment caused by transmission congestion. A viable solution is the deployment of energy storage systems (ESSs), which store excess energy during periods of high renewable generation and low demand and then discharge it when renewable output declines and demand rises. In addition, ESSs improve network operation by providing voltage control, energy flow management, and system restoration, improving overall grid stability and efficiency.

Co-expansion planning of transmission lines and energy storage devices (CETES) has gained significant attention in recent years due to its economic and technical benefits. This approach optimizes renewable energy utilization, alleviates transmission congestion, and reduces the need for additional transmission investments. However, despite its advantages, few studies incorporate unit commitment (UC) constraints into this framework.

The UC problem determines the optimal scheduling of generation units to minimize operational costs while satisfying system constraints. The increasing penetration of intermittent renewable sources introduces uncertainties that complicate UC decisions, requiring frequent adjustments in thermal generation. ESSs mitigate these challenges by smoothing power fluctuations, reducing the reliance on costly and polluting spinning reserves, and improving system reliability.

Literature Review

Co-expansion planning of transmission lines and energy storage devices has been the focus of recent research efforts. Table 1 summarizes the main characteristics of recent publications that propose methodologies to solve CETES. Table 1 provides a structured summary of the key characteristics of recent CETES studies, highlighting their methodological approaches, assumptions about network modeling, formulations of investment variables, and solution techniques. The articles are arranged chronologically to illustrate the evolution of research in this field.

In the reviewed works, two types of investment formulations for energy storage devices were identified: continuous (C) and binary (B). Binary formulations allow the allocation of storage devices with predefined power and energy capacity values, including integer-variable formulations. In contrast, continuous formulations optimize the power and energy capacities of the installed storage devices.

Regarding the planning horizon, CETES can be modeled in two ways: static (S) or dynamic (D), also referred to as multistage. Static models assume that all investments occur at the beginning of the period and are based on electricity demand at the end of the planning horizon, without considering construction timelines. In contrast, dynamic CETES divides the planning horizon into multiple stages, incorporating time constraints and interdependencies among investment decisions.

The reviewed works considered four energy storage technologies: Generic Energy Storage Systems (GESSs), Battery Energy Storage Systems (BESSs), Compressed Air Energy Storage (CAES), and Pumped Hydro Energy Storage (PHES). The term GESS is used for studies that consider energy storage systems without specifying a particular technology.

Most studies employ a DC power flow model without losses, a widely used linear formulation in CETES modeling. Furthermore, CETES solution methods mainly rely on mixed-integer linear programming (MILP) formulations, decomposition techniques, and column-and-constraint generation (CCG).

Among the evaluated papers, only one incorporated unit commitment constraints, highlighting an opportunity for further advancements in co-planning formulations of transmission and storage devices.

Several studies have modeled CETES as MILP problem. In [1,2], static CETES is analyzed without chronological scenarios, limiting accuracy by neglecting the dynamic behavior of demand and renewable energy sources. While Ref. [2] incorporates transmission losses, Ref. [1] assumes a lossless network. Reference [14] models static CETES with energy balance constraints and the N-1 security criterion, including investments in CAES and representative seasonal demand profiles. However, it does not account for the uncertainties in renewable generation or unit commitment constraints.

Dynamic CETES has been widely investigated using MILP formulations. The work [3] introduces an eight-year planning horizon divided into two four-year stages. In [6], the authors applies Nested Benders decomposition, considering long-term uncertainties and investments in storage and transmission lines with different construction times. The authors of [12] employ the Benders decomposition for a multistage CETES problem, integrating the N-1 security criterion and evaluating storage performance under contingencies.

To improve computational efficiency, several works adopt decomposition techniques. The work [4] applies the Benders decomposition, modeling storage investment as a continuous variable, diverging from previous discrete approaches. Reference [15] proposes a block-based multicut Benders decomposition to reduce simulation time and improve expansion planning. Ref. [13] integrates thyristor-controlled series compensators within a linearized AC optimal power flow MILP formulation, making the model applicable to reactive power studies.

Robust and hybrid optimization methods have also been explored. The authors of [9] formulate a three-level adaptive robust CETES model, addressing long-term uncertainties through robust sets and short-term variations via representative days, although it does not include unit commitment. In [10], the authors develop a hybrid stochastic–robust approach with continuous-time modeling to determine power scheduling and ramping activation, enabling fast sub-hourly adjustments to accommodate wind uncertainty and load variations. Reference [11] applies a robust co-planning strategy via the column-and-constraint generation algorithm, though the binary representation of storage charging/discharging increases computational complexity.

Market-driven CETES models have also been studied. The work [7] incorporates BESS with effects of capacity degradation and system lifetime effects, optimizing storage operation across price fluctuations based on representative daily scenarios. In [8], the authors propose a three-level CETES model, where the upper level maximizes storage profitability, the middle level optimizes transmission expansion, and the lower level simulates market clearing. The problem is reformulated into a bi-level structure and solved via CCG.

Among the reviewed studies, Ref. [5] is the only one explicitly incorporating a unit commitment model for thermal units. The work includes wind and load scenarios over a 25-year horizon while adjusting for transmission expansion delays and battery degradation. However, its UC model is overly simplistic, using a single binary variable to indicate generator status while disregarding minimum up/down times and startup/shutdown ramps.

2. Contributions

Building upon insights from the prior literature, this paper introduces a methodology for addressing the co-expansion planning of transmission lines and energy storage devices, accounting for uncertainties in both load demand and wind generation through probabilistic representative days. Furthermore, constraints on the unit commitment of thermal generation units are incorporated into the model, an aspect that has been minimally explored in the literature.

This paper has the following aims:

Formulate a stochastic optimization model for the co-expansion planning of transmission lines and energy storage devices.

Propose a solution strategy to address the problem, which involves decomposing the problem into a master problem and a subproblem.

3. Problem Formulation

The proposed co-expansion planning of transmission lines and energy storage devices is formulated as a bilevel stochastic mixed-integer nonlinear optimization model. This formulation incorporates static planning for the long-term horizon and adopts the DC network representation. The unit commitment model follows the approach proposed in [16], which requires fewer binary variables and constraints compared to other formulations, such as [17,18,19], significantly reducing computational complexity. This formulation effectively handles intertemporal constraints, including ramping limits and minimum up and down times. Uncertainties in wind generation and load profiles are addressed using representative daily scenarios. Each scenario is assigned a probability weight that reflects its expected occurrence over the year. The complete optimization model is presented in (1)–(32).

3.1. Objective Function

The objective function minimizes the total cost (C), which consists of four components. The first term represents the annualized investment cost in transmission lines ($C^{TL}$). The second and third terms correspond to the annualized investment cost in energy storage devices. Since the investment cost in energy storage depends on both the energy and power ratings of the unit, $C^{SE}$ represents for the energy component, while $C^{SP}$ represents the power component of the cost. Finally, the fourth term captures the operational cost over a one-year horizon, considering representative daily scenarios. This cost includes the generation cost of thermal units, the operational cost of storage systems, and the curtailment cost of wind generation. The mathematical formulation of the objective function is presented in Equations (1)–(5). All sets, indices, parameters, and variables used in the formulation are described in the Nomenclature section.

(1)$\min \hspace{1em}C=C^{TL}+C^{SE}+C^{SP}+C^{OP}$

(2)$C^{TL}=\sum _{l\in {\mathcal{L}}^c}{\alpha }_l·\left(C_l^{TL}·{\displaystyle \frac{r·{(1+r)}^{Y_l}}{{(1+r)}^{Y_l}-1}}\right)$

(3)$C^{SE}=\sum _{s\in {\mathcal{S}}^c}{\beta }_s·Z_s^{max}·\left(C_s^{SE}·{\displaystyle \frac{r·{(1+r)}^{Y_s}}{{(1+r)}^{Y_s}-1}}\right)$

(4)$C^{SP}=\sum _{s\in {\mathcal{S}}^c}{\beta }_s·P_s^{cha,max}·\left(C_s^{SP}·{\displaystyle \frac{r·{(1+r)}^{Y_s}}{{(1+r)}^{Y_s}-1}}\right)$

(5)$\begin{array}{cc}\hfill CO& =365\sum _{\varphi \in \Phi }{\gamma }_{\varphi }\left\{\sum _{h\in \mathcal{H}}\right[\sum _{g\in \mathcal{G}}\left(b_g·p_{gh\varphi }^{the}+a_g·u_{gh\varphi }^{the}\right)+\sum _{s\in \mathcal{S}}\mu ·\left(p_{sh\varphi }^{cha}+p_{sh\varphi }^{dis}\right)\hfill \\ & +\sum _{w\in \mathcal{W}}\eta ·p_{wh\varphi }^{cur}\left]\right\}\hfill \end{array}$

3.2. Constraints

The objective function (1) is subject to the constraints defined in (6)–(35).

(6)${\alpha }_l\le A_l^{max},:\forall :l\in {\mathcal{L}}^c$

(7)${\beta }_s\le B_s^{max},:\forall :s\in {\mathcal{S}}^c$

(8)$\begin{array}{cc}\hfill & \sum _{g\in {\mathcal{G}}_i}{p}_{gh\varphi }^{the}+\sum _{s\in {\mathcal{S}}_i}\left(p_{sh\varphi }^{dis}-p_{sh\varphi }^{cha}\right)-\sum _{l\in {\mathcal{L}}_i}{f}_{lh\varphi }+\sum _{w\in {\mathcal{W}}_i}\left(P_{wh\varphi }^{wid}-p_{wh\varphi }^{cur}\right)\hfill \\ & =D_{ih\varphi },\forall :i\in \mathcal{B},h\in \mathcal{H},\varphi \in \Phi \hfill \end{array}$

(9)$f_{lh\varphi }={\displaystyle \frac{{\theta }_{ih\varphi }-{\theta }_{jh\varphi }}{x_l}},\forall :l\in {\mathcal{L}}^E,\left(i,j\right)\in {\mathcal{B}}_l,h\in \mathcal{H},\varphi \in \Phi$

(10)$f_{lh\varphi }={\alpha }_l·\left({\displaystyle \frac{{\theta }_{ih\varphi }-{\theta }_{jh\varphi }}{x_l}}\right),\forall :l\in {\mathcal{L}}^c,\left(i,j\right)\in {\mathcal{B}}_l,h\in \mathcal{H},\varphi \in \Phi$

(11)$-f_l^{max}\le f_{lh\varphi }\le f_k^{max},\forall :l\in {\mathcal{L}}^E,h\in \mathcal{H},\varphi \in \Phi$

(12)$-{\alpha }_l·f_l^{max}\le f_{lh\varphi }\le {\alpha }_l·f_k^{max},\forall :l\in {\mathcal{L}}^E,h\in \mathcal{H},\varphi \in \Phi$

(13)$-{\theta }^{max}\le {\theta }_{ih\varphi },\le {\theta }^{max},\forall :i\in \mathcal{B},h\in \mathcal{H},\varphi \in \Phi$

(14)${\theta }_{ih\varphi }=0,\forall i\in {\mathcal{B}}_{\mathrm{ref}},h\in \mathcal{H},\varphi \in \Phi$

(15)$u_{gh\varphi }^{the}·P_g^{the,min}\le p_{gh\varphi }^{the}\le {\rho }_{gh\varphi }^{the},\forall :g\in \mathcal{G},h\in \mathcal{H},\varphi \in \Phi$

(16)$0\le {\rho }_{gh\varphi }^{the}\le u_{gh\varphi }^{the}·P_g^{the,max},\forall :g\in \mathcal{G},h\in \mathcal{H},\varphi \in \Phi$

(17)$\begin{array}{cc}\hfill & {\rho }_{gh\varphi }^{the}\le p_{g(h-1)\varphi }+R{U}_g·u_{g(h-1)\varphi }+S{U}_g·\left(u_{gh\varphi }^{the}-u_{g(h-1)\varphi }\right)+P_g^{the,max}·\left(1-u_{gh\varphi }^{the}\right),\hfill \\ \hfill & \forall :g\in \mathcal{G},h\in \mathcal{H},\varphi \in \Phi \hfill \end{array}$

(18)$\begin{array}{cc}\hfill & {\rho }_{gh\varphi }^{the}\le P_g^{the,max}·u_{g(h+1)\varphi }+S{D}_g·\left(u_{gh\varphi }^{the}-u_{g(h+1)\varphi }\right),\hfill \\ \hfill & \forall :g\in \mathcal{G},h=1\dots T-1,\varphi \in \Phi \hfill \end{array}$

(19)$\begin{array}{cc}\hfill & p_{g(h-1)\varphi }-p_{gh\varphi }^{the}\le R{D}_g·u_{gh\varphi }^{the}+S{D}_g·\left(u_{g(h-1)\varphi }-u_{gh\varphi }^{the}\right)+P_g^{the,max}·\left(1-u_{g(h-1)\varphi }\right),\hfill \\ \hfill & \forall :g\in \mathcal{G},h\in \mathcal{H},\varphi \in \Phi \hfill \end{array}$

(20)$\sum _{h=1}^{{\delta }_g}\left(1-u_{gh\varphi }^{the}\right)=0,\forall :g\in \mathcal{G},\varphi \in \Phi$

(21)$\begin{array}{cc}\hfill & \sum _{n=h}^{h+U{T}_g--1}{u}_{gn\varphi }\ge U{T}_g·\left(u_{gh\varphi }^{the}-u_{g(h-1)\varphi }\right),\hfill \\ \hfill & \forall :g\in \mathcal{G},h=G_g+1\dots T-U{T}_g+1,\varphi \in \Phi \hfill \end{array}$

(22)$\begin{array}{cc}\hfill & \sum _{n=h}^T\left[u_{gn\varphi }-\left(u_{gh\varphi }^{the}-u_{g(h-1)\varphi }\right)\right]\ge 0,\hfill \\ \hfill & \forall :g\in \mathcal{G},h=T-U{T}_g+2\dots T,\varphi \in \Phi \hfill \end{array}$

(23)$\sum _{h=1}^{{\zeta }_g}{u}_{gh\varphi }^{the}=0,\forall :g\in \mathcal{G},\varphi \in \Phi$

(24)$\begin{array}{cc}\hfill & \sum _{n=h}^{h+D{T}_g--1}\left(1-u_{gn\varphi }^{the}\right)\ge D{T}_g·\left(u_{g(h-1)\varphi }-u_{gh\varphi }^{the}\right),\hfill \\ \hfill & \forall :g\in \mathcal{G},h=L_g+1\dots T-D{T}_g+1,\varphi \in \Phi \hfill \end{array}$

(25)$\begin{array}{cc}\hfill & \sum _{n=h}^T\left[1-u_{gn\varphi }-\left(u_{g(h-1)\varphi }-u_{gh\varphi }^{the}\right)\right]\ge 0,\hfill \\ \hfill & \forall :g\in \mathcal{G},h=T-D{T}_g+2\dots T,\varphi \in \Phi \hfill \end{array}$

(26)$Z_s^{min}\le z_{sh\varphi }\le Z_s^{max},\forall :s\in {\mathcal{S}}^E,h\in \mathcal{H},\varphi \in \Phi$

(27)${\beta }_s·Z_s^{min}\le z_{sh\varphi }\le {\beta }_s·Z_s^{max},\forall :s\in {\mathcal{S}}^c,h\in \mathcal{H},\varphi \in \Phi$

(28)$P_s^{dis,min}\le p_{sh\varphi }^{dis}\le P_s^{dis,max},\forall :s\in {\mathcal{S}}^E,h\in \mathcal{H},\varphi \in \Phi$

(29)${\beta }_s·P_s^{dis,min}\le p_{sh\varphi }^{dis}\le {\beta }_s·P_s^{dis,max},\forall :s\in {\mathcal{S}}^c,h\in \mathcal{H},\varphi \in \Phi$

(30)$P_s^{cha,min}\le p_{sh\varphi }^{cha}\le P_s^{cha,max},\forall :s\in {\mathcal{S}}^E,h\in \mathcal{H},\varphi \in \Phi$

(31)${\beta }_s·P_s^{cha,min}\le p_{sh\varphi }^{cha}\le {\beta }_s·P_s^{cha,max},\forall :s\in {\mathcal{S}}^c,h\in \mathcal{H},\varphi \in \Phi$

(32)$z_{sh\varphi }=z_{s\left(h-1\right)\varphi }-{\displaystyle \frac{1}{{\sigma }_s^{dis}}}·p_{sh\varphi }^{dis}+{\sigma }_s^{cha}·p_{sh\varphi }^{cha},\forall :s\in \mathcal{S},h\in \mathcal{H},\varphi \in \Phi$

(33)$z_{s\left(h=0\right)\varphi }=Z_s^0,\forall :s\in \mathcal{S},\varphi \in \Phi$

(34)$z_{s\left(h=T\right)\varphi }\ge Z_s^T,\forall :s\in \mathcal{S},\varphi \in \Phi$

(35)$0\le p_{wh\varphi }^{cur}\le P_{wh\varphi }^{wid},\forall :w\in \mathcal{W},h\in \mathcal{H},\varphi \in \Phi$

The constraints (6) and (7) enforce the investment in the transmission line and energy storage device, respectively.

The constraints related to power flow are presented in (8)–(14). Constraint (8) ensures power balance at each bus. Constraints (9) and (10) model the power flow through existing and candidate transmission lines, respectively. Constraints (11) and (12) enforce power flow limits on existing and candidate lines, respectively. Constraint (13) defines the upper and lower limits for the bus angles, while the constraint (14) sets the angle of the reference bus to zero.

The constraints related to the operation of thermal generator units are presented in (15)–(25). These constraints represent the unit commitment model proposed in [16]. Constraint (15) defines the generation limits for each unit, ensuring that the power output remains within the minimum and maximum allowed values. Constraint (16) limits the maximum available power output of each unit, considering its on/off status. Constraint (17) enforces ramp-up and startup ramp limits. Constraint (18) enforces shutdown ramp limits. Constraint (19) imposes ramp-down limits. Constraint (20) ensures that units initially online remain online for the required minimum up-time. Constraint (21) ensures that once a unit is started, it remains online for the specified minimum up-time. Constraint (22) ensures that units started near the end of the time horizon remain online until the end. Constraint (23) ensures that units initially offline remain offline for the required minimum down-time. Constraint (24) ensures that once a unit is shut down, it remains offline for the specified minimum down-time. Constraint (25) ensures that units shut down near the end of the time horizon remain offline until the end.

The constraints related to energy storage devices are presented in (26)–(32). Constraints (26) and (27) limit the state of charge (SOC) of the existing and candidate storage devices, respectively. Constraints (28) and (29) limit the discharge power of existing and candidate storage devices, respectively. Constraints (30) and (31) limit the charge power of existing and candidate storage devices, respectively. Constraint (32) represents the energy balance of the storage devices, updating the SOC based on charging and discharging.

The constraint (35) limits the curtailment of the wind, ensuring that the curtailed power does not exceed the available wind generation.

4. Solution Strategy

To address the mixed-integer nonlinear problem, this work proposes a decomposition strategy that separates it into an investment master problem and an operational subproblem.

The investment master problem determines the optimal investment decisions by defining the integer investment variables for transmission lines $\left({\alpha }_l,\forall l\in {\mathcal{L}}^c\right)$ and energy storage devices $\left({\beta }_s,\forall s\in {\mathcal{S}}^c\right)$.

The operational subproblem evaluates the operational cost of the system ($CO$) in all scenarios over a one-year horizon. This cost is then fed back into the investment master problem to iteratively refine investment decisions. The operational subproblem solves the network-constrained unit commitment for each scenario, treating the investments determined by the master problem as implemented. Specifically, transmission lines and storage devices with positive investment values (${\alpha }_l>0$ or ${\beta }_s>0$) are incorporated into the sets of existing transmission lines (${\mathcal{L}}^e$) and storage systems (${\mathcal{S}}^e$).

This decomposition eliminates the nonlinearity of the original problem, allowing an iterative solution process between the investment master problem and the operational subproblem. The investment problem is solved using a genetic algorithm-based optimization approach, while the operational subproblem is addressed with commercial MILP solvers. Figure 1 illustrates the process.

4.1. Investment Master Problem

The genetic algorithm used in this study employs four main operators: selection, crossover, mutation, and elitism.

Each chromosome (individual) consists of two independent segments: one for transmission line investments and another for storage system investments. Figure 2 illustrates a chromosome representation for a fictitious system with five candidate branches for transmission expansion and four candidate buses for the installation of energy storage. In this example, the chromosome specifies the construction of one transmission line on the first candidate branch, two lines on the third, and three lines on the fourth. Similarly, it indicates investments in five storage units at the first candidate bus and three at the second.

To maintain structural integrity, crossover and mutation operations are applied separately within each segment (transmission line investment or energy storage investment). This prevents infeasible solutions caused by swapping genes between unrelated components since the upper limits $A_l^{max}$ and $B_s^{max}$ may differ depending on the system under analysis.

The crossover process is modified to occur exclusively within each segment. This prevents transmission line investments from being swapped with storage investments, preserving chromosome integrity, and eliminating the risk of infeasible solutions.

Mutation operator adjustments are made so that random alterations affect only one category at a time (transmission, storage, or both). This ensures that mutations adhere to system constraints, preventing structural inconsistencies.

The fitness value of each chromosome is computed after solving the operational subproblem. It corresponds to the sum of the four cost components in the original objective function (1) plus a penalty cost $C^{PE}$. A lower fitness value indicates a better performing chromosome relative to others.

The penalty cost is applied when the operational subproblem is infeasible for any scenario analyzed. To strongly discourage insufficient investment solutions, a high penalty value USD ${10}^{12}$ is used.

Figure 3 illustrates the step-by-step procedure of the proposed methodology.

Step 1: Representative day scenarios for wind generation and load demand are created using a clustering algorithm. These scenarios are used to model the uncertainties in the system.

Step 2: An initial population of candidate solutions (chromosomes) is randomly generated. Each chromosome represents a possible investment plan, including the expansion of transmission lines and energy storage systems.

Step 3: The fitness of each chromosome in the initial population is evaluated based on its total investment and operational cost, obtained by solving a unit commitment problem.

Step 4: Genetic operators, selection, crossover, mutation, and elitism are applied to evolve the population.

Step 5: The fitness of the new population is evaluated, following the same procedure as in Step 3.

The algorithm then checks whether the stopping criterion has been met (e.g., the maximum number of iterations or convergence threshold). If the criterion is satisfied, the algorithm terminates; otherwise, it returns to Step 4 to continue the evolutionary process.

This approach allows for efficient exploration of the large combinatorial search space associated with co-expansion planning while ensuring high-quality solutions.

4.2. Operational Subproblem

The operational subproblem receives investment decisions from the investment master problem, specifically the integer investment variables for transmission lines (${\alpha }_l,\forall l\in {\mathcal{L}}^c$) and energy storage devices (${\beta }_s,\forall s\in {\mathcal{S}}^c$). Transmission lines and storage devices with positive investment values (${\alpha }_l>0$ or ${\beta }_s>0$) are incorporated into the sets of existing transmission lines (${\mathcal{L}}^e$) and storage systems (${\mathcal{S}}^e$).

Based on these decisions, the operational subproblem is formulated as a stochastic network-constrained unit commitment model, represented as a mixed-integer linear optimization problem. The objective is to minimize the annual operational cost while accounting for uncertainties in wind generation and electricity demand. A set of representative daily scenarios is considered, where each scenario $\varphi$ is assigned a probability weight ${\gamma }_{\varphi }$, reflecting its probability of occurrence over the year.

The mathematical formulation of the stochastic network-constrained unit commitment model is presented below.

(36)$\begin{array}{cc}\hfill \min CO=365\sum _{\varphi \in \Phi }{\gamma }_{\varphi }& \left\{\sum _{h\in \mathcal{H}}\right[\sum _{g\in \mathcal{G}}\left(b_g·p_{gh\varphi }^{the}+a_g·u_{gh\varphi }^{the}\right)\hfill \\ & +\sum _{s\in \mathcal{S}}\mu ·\left(p_{sh\varphi }^{cha}+p_{sh\varphi }^{dis}\right)+\sum _{w\in \mathcal{W}}\eta ·p_{wh\varphi }^{cur}\left]\right\}\hfill \end{array}$

subject to (8), (9), (11), (13)–(26), (28), (30), (32), and (35).

5. Simulations

This section presents the results obtained using the proposed methodology on a modified IEEE-RTS 24-bus test system [20]. The system comprises 24 buses and 41 candidate branches for expansion. Each branch can accommodate up to three transmission lines. The investment costs for the candidate lines of 230 kV and 132 kV are USD 120,000.0/km and USD 70,000.0/km, respectively [20].

The load profile and the technical data of the thermal generation units were obtained from [20,21]. Table 2 summarizes the main characteristics of these units. The original system data presented in [20,21] are not suitable for long-term planning. To accommodate a long-term planning approach, the capacities of all existing transmission lines are reduced to one-third of their original values, following [2]. In addition, the maximum thermal generator capacity and up-ramp limit are doubled.

The system includes three wind farms located at buses 20, 21, and 23, with maximum generation capacities of 900.0 MW, 600.0 MW, and 300.0 MW, respectively. Following [22], the generation cost of these wind farms is set to zero. The curtailment cost of wind generation is adopted as USD 80/MW, as used in [23].

Energy storage investments are considered at buses 5, 6, 8, 10, 11, and 14, following [15]. Each bus can accommodate up to five storage units, with each unit having a power capacity of 100 MW and an energy capacity of 500 MWh. The subsidized costs are set at USD 500.0/kW (power) and USD 20.0/kWh (energy), as used in [8]. The charging and discharge efficiencies of the energy storage device are 95%. Investment costs are annualized using an interest rate 5%, with assumed lifetimes of 60 years for transmission lines [8,15] and 20 years for storage devices [15]. The maximum number of energy storage devices that can be invested at each bus is five.

The study analyzes five representative daily scenarios to capture hourly variations in demand and wind generation at the three wind farms. These scenarios are derived from historical load and wind generation data [24]. The k-means clustering technique is applied to group the data and assign weighted probabilities to each scenario. The complete system data and scenarios are available in [25].

Two case studies are investigated:

Case A: Investments in transmission line.

Case B: Investments in transmission line and energy storage device.

The parameters of the genetic algorithm are presented in Table 3. These parameters were defined empirically. For all cases, the convergence criterion is the maximum number of iterations. Ten simulations were conducted for each case defined in the following. All simulations were performed on a 2.7 GHz Intel^® Core i7 processor, with the codes implemented in MATLAB^® software version R2015a.

Results

Table 4 summarizes the the best investment investment decisions obtained for each planning case. The table presents the total investment costs, disaggregated into transmission and storage components, as well as the corresponding annual operating costs under uncertainty. In addition, it details the specific transmission lines selected for expansion and the location and the number of ESS units installed in Case B.

For Case A, the optimal solution includes a transmission line investment cost of USD 1494.0 M, involving the construction of one line between buses 2–6, 3–9, 4–9, 6–10, 7–8, 9–12, 12–23, 14–16, 15–16, 16–17, 18–21, 20–23, and 14–23. In addition, two transmission lines are constructed between buses 1–5, 9–11, 11–14, 12–13, 17–22, and 1–8, while three lines are added between buses 6–7. The corresponding annual operational cost is USD 42,702.86 M.

For Case B, the optimal solution involves a transmission line investment cost of USD 1,193.00 M and an energy storage investment of USD 136.00 M. The transmission expansion plan suggests building new lines between buses 2–6, 3–9, 3–24, 4–9, 5–10, 6–10, 8–9, 9–11, 10–11, 11–14, 12–23, 14–16, 15–21, 15–24, 16–17, 17–18, 17–22, 20–23, and 13–14, along with the addition of two transmission lines between buses 1–5, 7–8, 1–8, and 14–23.

The investment in energy storage includes the installation of one storage unit at bus 5, one unit at bus 6, and two storage units at buses 11 and 14. This combined investment in transmission lines and energy storage results in an annual operating cost of USD 81 .60 M.

It is evident that Case B presents a more cost-effective transmission expansion plan compared to Case A, with a cost reduction of 20.15%. The total expansion cost in Case B, including both transmission line and energy storage investments USD 1274.6 M, remains 14.69% lower than the transmission expansion cost in Case A. Additionally, the annual operating cost of Case B is 26.19% lower than that of Case A. These results highlight the economic benefits of considering the co-expansion planning of transmission lines and energy storage devices.

Table 5 summarizes the best solutions obtained for each case, including the stochastic thermal generation, energy charged, energy discharged, and wind curtailment. These values are calculated by summing the total output for each scenario, multiplying by the probability of the scenario, and then aggregating the results across all five scenarios.

The stochastic thermal generation and wind curtailment in Case B are both lower than in Case A. Specifically, Case B reduces thermal generation by 87.25 MWh compared to Case A, which translates to an annual reduction of 31,846.25 MWh. Additionally, Case B decreases wind curtailment by 360.32 MWh, equivalent to 131,516.8 MWh of avoided wind curtailment per year. This reduction is primarily due to the presence of energy storage systems, which decrease the dependence on thermal generation by enhancing operational flexibility and enabling a more cost-effective dispatch of thermal units while adhering to unit commitment constraints. Furthermore, storage systems mitigate wind curtailment by storing surplus wind energy and discharging it when it is most economically beneficial to the system. As a result, Case B achieves a 91.99% reduction in curtailed wind energy compared to Case A.

Table 6 and Table 7 present the optimal dispatch of the thermal generator units for each hour of the first scenario, corresponding to the best solution found for Case A and Case B, respectively. These tables demonstrate that the model complies with unit commitment constraints, thus validating the effectiveness of the proposed methodology. It can be observed that the operational profiles of the thermal units differ significantly between the two cases. In Case A, the thermal units operate at a total cost of USD 135.484 M, whereas in Case B, the operation cost is reduced to USD 105.936 M. This indicates that the joint expansion of transmission lines and energy storage systems leads to a reduction in the operational cost of thermal generation by approximately 21.81%, highlighting the economic benefits of co-expansion planning.

Figure 4 and Figure 5 present the charge and discharge output for the first scenario of the energy storage devices invested in Case B. The Y-axis in Figure 4 shows the charging power (MW) of each ESS, while the Y-axis in Figure 5 represents the amount of power discharged into the grid. The X-axis in both figures corresponds to the time of day (hours). It can be observed that energy storage systems follow a charging pattern during the early hours of the day (00:00–05:00) and late night (20:00–23:00), periods when demand is lower. In contrast, discharge occurs primarily in the afternoon (12:00–19:00), aligning with the period of higher load demand.

6. Conclusions

This paper proposed a methodology for the co-expansion planning of transmission lines and energy storage systems, incorporating demand and wind generation uncertainties through representative day scenarios and including unit commitment constraints for thermal generators to reflect realistic operational dynamics. The problem was formulated as a mixed-integer nonlinear program and solved using a decomposition approach that combines genetic algorithms with classical optimization techniques.

The results demonstrate that co-planning leads to significant economic benefits compared to transmission-only expansion. Specifically, the proposed approach achieved a 14.69% reduction in total expansion costs, a 26.19% decrease in annual operational costs, and a 91.99% reduction in wind curtailment, highlighting the synergy between transmission expansion and ESS investments. These improvements are primarily due to the improved system flexibility provided by storage, which reduces dependence on thermal generation and improves the integration of renewable energy.

The results highlight the interdependence between transmission expansion and energy storage investments, as well as their impact on market indices. Furthermore, the findings indicate that co-planning transmission lines and energy storage devices leads to greater economic efficiency, reducing both investment and operational costs compared to planning transmission expansion alone.

Future Work

Future research will aim to enhance the realism and applicability of the proposed framework through the following extensions:

Integration of hydroelectric power plants, introducing long-term storage capabilities and seasonal planning aspects;

Expansion of the formulation to include AC power flow constraints, improving the electrical accuracy of the model;

Application of the methodology to larger test systems, allowing for evaluation of scalability and computational performance.

Author Contributions

Conceptualization, E.J.d.O. and L.S.N.; methodology, E.J.d.O. and L.S.N.; software, L.S.N.; validation, E.J.d.O. and L.S.N.; formal analysis, E.J.d.O., L.S.N., L.W.d.O. and A.N.d.P.; investigation, L.S.N.; writing—original draft preparation, E.J.d.O. and L.S.N.; writing—review and editing, E.J.d.O., L.S.N., L.W.d.O. and A.N.d.P.; supervision, E.J.d.O.; project administration, E.J.d.O. and L.S.N. All authors have read and agreed to the published version of the manuscript.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

The required data are provided in the paper.

Acknowledgments

The authors gratefully acknowledge the Brazilian agency for the financial support in part of the Brazilian Federal Agency for the Support and Evaluation of Graduate Education (CAPES), the National Research Council (CNPq), the Brazilian Institute of Science and Technology (INERGE), and the State of Minas Gerais Research Foundation (FAPEMIG). The authors also express gratitude for the educational support of the Federal University of Juiz de Fora (UFJF).

Conflicts of Interest

The authors declare no conflicts of interest.

Abbreviations

g	Index of generating units
h	Index of time periods
$\varphi$	Index of scenarios or phases
$i,j$	Indexes of buses
l	Index of transmission lines
s	Index of storage units
w	Index of wind units
$\mathcal{G}$	Set of generating units
$\mathcal{H}$	Set of time periods
$\Phi$	Set of scenarios or phases
$\mathcal{B}$	Set of buses
${\mathcal{L}}^E$	Set of existing transmission lines
${\mathcal{L}}^C$	Set of candidate transmission lines
$\mathcal{S}$	Set of storage units
${\mathcal{S}}^E$	Set of existing storage units
${\mathcal{S}}^C$	Set of candidate storage units
$\mathcal{W}$	Set of wind units
$P_g^{the,min}$	Minimum power output of thermal unit g
$P_g^{the,max}$	Maximum power output of thermal unit g
$R{U}_g$	Ramp-up limit of thermal unit g
$R{D}_g$	Ramp-down limit of thermal unit g
$S{U}_g$	Startup ramp limit of thermal unit g
$S{D}_g$	Shutdown ramp limit of thermal unit g
$U{T}_g$	Minimum up-time of thermal unit g
$D{T}_g$	Minimum down-time of thermal unit g
$G_g$	Number of initial periods thermal unit g must be online
$L_g$	Number of initial periods thermal unit g must be offline
T	Total number of time periods
$D_{ih\varphi }$	Load demand at bus i in period h and scenario $\varphi$
$f_l^{max}$	Maximum power flow limit of transmission line l
$x_l$	Reactance of transmission line l
${\theta }^{max}$	Maximum bus angle limit
$Z_s^{min}$	Minimum state of charge (SOC) of storage unit s
$Z_s^{max}$	Maximum state of charge (SOC) of storage unit s
$P_s^{dis,min}$	Minimum discharge power of storage unit s
$P_s^{dis,max}$	Maximum discharge power of storage unit s
$P_s^{cha,min}$	Minimum charge power of storage unit s
$P_s^{cha,max}$	Maximum charge power of storage unit s
${\sigma }_s^{dis}$	Discharge efficiency of storage unit s
${\sigma }_s^{cha}$	Charge efficiency of storage unit s
$P_{wh\varphi }^{wid}$	Available wind power of wind unit w in period h and scenario $\varphi$
$C_l^{TL}$	Investment cost of transmission line l
$C_s^{SE}$	Energy component of the investment cost for storage unit s
$C_s^{SP}$	Power component of the investment cost for storage unit s
r	Discount rate
$Y_l$	Lifetime of transmission line l
$Y_s$	Lifetime of storage unit s
$a_g$	Fixed cost of operating thermal unit g (USD)
$b_g$	Variable cost of operating thermal unit g (USD/MW)
$\mu$	Operational cost of storage units (USD/MW)
$\eta$	Curtailment cost of wind generation (USD/MWh)
${\gamma }_{\varphi }$	Weight of scenario $\varphi$
$u_{gh\varphi }^{the}$	Binary variable indicating if thermal unit g is online (1) or offline (0) in period h and scenario $\varphi$
$p_{gh\varphi }^{the}$	Power output of thermal unit g in period h and scenario $\varphi$
${\rho }_{gh\varphi }^{the}$	Maximum available power output of thermal unit g in period h and scenario $\varphi$
$f_{lh\varphi }$	Power flow in transmission line l in period h and scenario $\varphi$
${\theta }_{ih\varphi }$	Voltage angle at bus i in period h and scenario $\varphi$
$z_{sh\varphi }$	State of charge (SOC) of storage unit s in period h and scenario $\varphi$
$p_{sh\varphi }^{dis}$	Discharge power of storage unit s in period h and scenario $\varphi$
$p_{sh\varphi }^{cha}$	Charge power of storage unit s in period h and scenario $\varphi$
$p_{wh\varphi }^{cur}$	Curtailed wind power of wind unit w in period h and scenario $\varphi$
${\alpha }_l$	Binary variable indicating if candidate transmission line l is built
${\beta }_s$	Binary variable indicating if candidate storage unit s is built
TNEP	Transmission Network Expansion Planning
ESS	Energy Storage System
CETES	Co-expansion planning of transmission lines and energy storage devices
UC	Unit Commitment
GESS	Generic Energy Storage System
BESS	Battery Energy Storage System
CAES	Compressed Air Energy Storage
PHES	Pumped Hydro Energy Storage
MILP	Mixed-Integer Linear Programming
CCG	Column-and-Constraint Generation
GA	Genetic Algorithm

Footnotes

Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Figures and Tables

Figure 1 Flowchart of the solution strategy.

Figure 2 Chromosome encoding.

Figure 3 Step-by-step flowchart of the proposed methodology.

Figure 4 Charge operation of energy storage systems for Case B —First scenario.

Figure 5 Discharge operation of energy storage systems for Case B —First scenario.

Table 1

Taxonomy of recent publications that propose methodologies for solving co-planning of transmission and storage devices.

Reference	Uncertainties	PlanningHorizon	UC	NetworkRepresentation	StorageInvestment	Technology	Sistema	Model
[1]	No	S	No	Lossless DC	B	GESS	Garver 6-busIEEE 24-busBrazil 46-bus	MILPSolver
[2]	No	S	No	DC	B	GESS	Garver 6-busIEEE 24-bus	MILPSolver
[3]	No	D	No	Lossless DC	B	BESS	Roy Billinton 6-busIEEE 24-bus	MILPSolver
[4]	No	S	No	Lossless DC	C	GESS	Garver 6-busIEEE 24-busBrazil 46-bus	BendersDecomposition
[5]	Yes	D	Yes	Lossless DC	C	BESS	IEEE 24-busIEEE 118-bus	MILPSolver
[6]	No	D	No	Lossless DC	B	BESSCAESPHES	IEEE 118-bus	Nested BendersDecomposition
[7]	Yes	S	No	DC	B	BESS	Garver 6-busIEEE 24-bus	MILPSolver
[8]	Yes	S	No	Lossless DC	C	BESS	WECC system 240-bus	CCG
[9]	Yes	S	No	Lossless DC	B	GESS	IEEE 24-bus	BendersDecomposition
[10]	Yes	S	No	Lossless DC	B	GESS	IEEE 24-bus	BendersDecomposition
[10]	Yes	S	No	Lossless DC	B	GESS	IEEE 24-bus	BendersDecomposition
[11]	Yes	S	No	Lossless DC	C	BESS	Garver 6-busChinese 196-bus	CCG
[12]	Yes	D	No	Lossless DC	B	BESSPHES	Garver 6-busGansu-53 bus	BendersDecomposition
[13]	No	S	No	AC	C	BESS	IEEE 24-bus	BendersDecomposition
[14]	No	S	No	Lossless DC	B	CAES	Garver 6-busIEEE 24-bus	MILPSolver
[15]	Yes	S	No	Lossless DC	B	BESS	Garver 6-busIEEE 24-bus IEEE 118-bus	BendersDecomposition
This Work	Yes	S	Yes	Lossless DC	B	GESS	IEEE 24-bus	DecompositionGAMILP Solver

Table 2

Data of the thermal generator units.

Unit	Bus	${\mathit{P}}_{\mathit{g}}^{max}$	${\mathit{P}}_{\mathit{g}}^{min}$	$\mathit{R}{\mathit{U}}_{\mathit{g}}$	$\mathit{R}{\mathit{D}}_{\mathit{g}}$	$\mathit{U}{\mathit{T}}_{\mathit{g}}$	$\mathit{D}{\mathit{T}}_{\mathit{g}}$	${\mathit{P}}_{0\mathit{g}}$	${\mathit{u}}_{0\mathit{g}}$	${\mathit{G}}_{\mathit{g}}$	${\mathit{L}}_{\mathit{g}}$	${\mathit{a}}_{\mathit{g}}$	${\mathit{b}}_{\mathit{g}}$	${\mathit{c}}_{\mathit{g}}$	$\mathit{C}\mathit{S}{\mathit{U}}_{\mathit{g}}$	$\mathit{C}\mathit{S}{\mathit{D}}_{\mathit{g}}$	$\mathit{S}{\mathit{U}}_{\mathit{g}}$	$\mathit{S}{\mathit{D}}_{\mathit{g}}$
1	1	152.00	30.40	120.00	120.00	8	4	76.00	1	22	0	0.01	13.32	108.00	1430.40	715.20	152.00	152.00
2	2	152.00	30.40	120.00	120.00	8	4	76.00	1	22	0	0.07	13.32	108.00	1430.40	715.20	152.00	152.00
3	7	350.00	75.00	350.00	350.00	8	8	0.00	0	0	2	0.00	20.70	118.00	1725.00	862.50	300.00	300.00
4	13	591.00	206.85	240.00	240.00	12	10	0.00	0	0	1	0.01	20.93	94.00	3056.70	1528.35	591.00	591.00
5	15	60.00	12.00	60.00	60.00	4	2	0.00	0	0	1	0.03	26.11	84.00	437.00	218.50	60.00	60.00
6	15	155.00	54.25	155.00	155.00	8	8	0.00	0	0	2	0.01	10.52	118.00	312.00	156.00	89.20	89.20
7	16	155.00	54.25	155.00	155.00	8	8	124.00	1	10	0	0.01	10.52	118.00	312.00	156.00	89.20	89.20
8	18	400.00	100.00	280.00	280.00	1	1	240.00	1	50	0	0.03	6.02	177.00	0.00	0.00	240.00	240.00
9	21	400.00	100.00	280.00	280.00	1	1	240.00	1	16	0	0.03	5.47	177.00	0.00	0.00	240.00	240.00
10	22	300.00	300.00	300.00	300.00	1	1	240.00	1	24	0	0.01	2.00	177.00	0.00	0.00	300.00	300.00
11	23	310.00	108.50	180.00	180.00	8	8	248.00	1	10	0	0.01	10.52	118.00	624.00	312.00	178.50	178.50
12	23	350.00	140.00	240.00	240.00	8	8	280.00	1	50	0	0.01	10.89	118.00	2298.00	1149.00	210.00	210.0

Table 3

Parameters of the genetic algorithm.

Parameters	Value
Number of chromosomes	20
Maximum number of iterations	50
Crossover rate	0.7
Mutation rate	0.3
Number of tournament participants	4
Size of the elite set	2

Table 4

Best solution for each case—part 1.

Case	Total Investment Cost in Lines (USD/M)	Total Investment Cost in Storage (USD/M)	Annual Operational Cost (USD/M)	Transmission Expansion	Storage Expansion
A	1494.0	-	42,702.86	1–5 (2), 2–6, 3–9, 4–9, 6–10, 7–8,9–11 (2), 9–12, 11–14 (2), 12–13 (2), 12–23,14–16, 15–16, 16–17, 17–22 (2), 18–21,20–23, 1–8 (2), 6–7 (3), 14–23	–
B	1193.00	81.60	31,520.56	1–5 (2), 2–6, 3–9, 3–24, 4–9, 5–10,6–10, 7–8 (2), 8–9, 9–11, 10–11, 11–14,12–23, 14–16, 15–21, 15–24, 16–17, 17–18,17–22, 20–23, 1–8 (2), 13–14, 14–23 (2)	5 (1), 6 (1),11 (2), 14 (2)

Table 5

Best solution for each case—part 2.

Case	StochasticThermal Generation(MWh)	StochasticEnergy Charged (MWh)	StochasticEnergy Discharged (MWh)	StochasticWind Curtailment(MWh)
A	43,171.06	-	-	391.72
B	43,083.81	2800.79	2527.72	31.40

Table 6

Power generation schedule of the optimal solution for Case A —First scenario.

Hour	Power Generation of Units (MW)
1	197.67	30.40	0	0	0	0	54.25	0	101.25	600.00	108.50	140.00
2	133.19	30.40	0	0	0	0	54.25	0	102.57	600.00	0	140.00
3	90.44	30.40	0	0	0	0	100.40	0	0	600.00	0	140.00
4	74.42	30.40	0	0	0	0	94.68	0	0	600.00	0	140.00
5	77.64	30.40	0	0	0	0	54.25	0	100.00	572.26	0	140.00
6	112.00	30.40	0	0	0	0	54.25	172.21	0	600.00	0	140.00
7	290.92	59.88	0	0	0	0	54.25	479.54	0	600.00	0	169.49
8	304.00	216.76	0	0	0	0	54.25	548.09	0	600.00	0	363.13
9	304.00	278.27	75.00	0	0	0	54.25	593.20	0	600.00	0	543.89
10	304.00	286.44	125.64	0	0	0	58.51	635.42	0	600.00	0	629.94
11	304.00	291.65	183.89	0	0	0	83.65	666.23	0	600.00	0	656.30
12	304.00	293.57	205.36	0	0	0	92.39	686.24	0	600.00	0	680.72
13	304.00	297.49	249.21	0	0	0	112.70	698.56	0	600.00	0	691.21
14	304.00	301.18	290.40	0	0	0	132.23	706.28	0	600.00	0	693.36
15	304.00	300.87	286.99	0	0	0	130.90	701.81	0	600.00	0	687.63
16	304.00	303.12	312.10	0	0	0	143.34	700.74	0	600.00	0	684.49
17	304.00	265.65	499.92	0	0	0	201.23	710.52	0	600.00	0	682.46
18	304.00	248.98	544.69	0	0	0	211.25	700.82	0	600.00	0	666.64
19	304.00	250.80	539.80	0	0	0	214.74	647.02	0	600.00	0	595.51
20	304.00	304.00	354.63	0	0	0	173.22	572.58	0	600.00	0	510.10
21	304.00	296.48	236.69	0	0	0	89.20	492.86	0	600.00	0	435.96
22	304.00	222.33	75.00	0	0	0	0	416.73	0	600.00	0	371.06
23	253.74	40.32	75.00	0	0	0	0	300.58	0	600.00	0	140.00
24	109.81	0	75.00	0	0	0	0	125.79	0	600.00	0	0

Table 7

Power generation schedule of the optimal solution for Case B —First scenario.

Hour	Power Generation of Units (MW)
	1	2	3	4	5	6	7	8	9	10	11	12
1	30.40	30.40	0	0	0	0	54.25	0	373.36	600.00	108.50	140.00
2	30.40	30.40	0	0	0	0	0	0	601.29	600.00	108.50	0
3	30.40	30.40	0	0	0	0	0	0	434.06	600.00	108.50	0
4	73.42	30.40	0	0	0	0	0	0	628.96	600.00	108.50	0
5	30.40	30.40	0	0	0	0	0	0	524.33	600.00	108.50	0
6	30.40	30.40	0	0	0	0	0	0	440.52	600.00	108.50	0
7	59.07	30.40	0	0	0	0	0	0	722.64	600.00	241.96	0
8	81.49	30.40	0	0	0	0	0	100.00	788.85	600.00	399.29	0
9	302.11	71.97	0	0	0	0	0	150.39	800.00	600.00	524.16	0
10	304.00	129.37	0	0	0	0	0	186.60	800.00	600.00	619.98	0
11	230.15	232.75	0	0	0	0	0	215.68	800.00	600.00	620.00	0
12	282.37	258.96	0	0	0	0	0	226.42	800.00	600.00	620.00	0
13	304.00	268.98	0	0	0	0	0	226.47	800.00	600.00	620.00	0
14	304.00	268.30	0	0	0	0	0	230.92	800.00	600.00	620.00	0
15	304.00	269.52	0	0	0	0	0	213.57	800.00	600.00	620.00	0
16	304.00	271.93	0	0	0	0	0	240.66	800.00	600.00	620.00	0
17	304.00	287.82	0	0	0	0	0	241.26	800.00	600.00	620.00	0
18	304.00	276.08	0	0	0	0	0	252.16	800.00	600.00	620.00	0
19	304.00	285.72	0	0	0	0	0	264.52	800.00	600.00	620.00	0
20	304.00	273.30	0	0	0	0	0	198.99	800.00	600.00	620.00	0
21	304.00	152.00	0	0	0	0	0	132.26	800.00	600.00	526.89	0
22	147.71	0	0	0	0	0	0	100.00	800.00	558.74	429.90	0
23	171.29	0	0	0	0	0	0	0	747.20	591.09	178.50	0
24	139.23	0	0	0	0	0	0	0	608.18	597.87	0	0

References

1. Hu, Z.; Zhang, F.; Li, B. Transmission expansion planning considering the deployment of energy storage systems. Proceedings of the 2012 IEEE Power and Energy Society General Meeting; San Diego, CA, USA, 22–26 July 2012; IEEE: Piscataway, NJ, USA, 2012; pp. 1-6.

2. Zhang, F.; Hu, Z.; Song, Y. Mixed-integer linear model for transmission expansion planning with line losses and energy storage systems. IET Gener. Transm. Distrib.; 2013; 7, pp. 919-928. [DOI: https://dx.doi.org/10.1049/iet-gtd.2012.0666]

3. Hedayati, M.; Zhang, J.; Hedman, K.W. Joint transmission expansion planning and energy storage placement in smart grid towards efficient integration of renewable energy. Proceedings of the 2014 IEEE PES T&D Conference and Exposition; Chicago, IL, USA, 14–17 April 2014; IEEE: Piscataway, NJ, USA, 2014; pp. 1-5.

4. MacRae, C.; Ernst, A.; Ozlen, M. A Benders decomposition approach to transmission expansion planning considering energy storage. Energy; 2016; 112, pp. 795-803. [DOI: https://dx.doi.org/10.1016/j.energy.2016.06.080]

5. Qiu, T.; Xu, B.; Wang, Y.; Dvorkin, Y.; Kirschen, D.S. Stochastic multistage coplanning of transmission expansion and energy storage. IEEE Trans. Power Syst.; 2016; 32, pp. 643-651. [DOI: https://dx.doi.org/10.1109/TPWRS.2016.2553678]

6. Falugi, P.; Konstantelos, I.; Strbac, G. Planning with multiple transmission and storage investment options under uncertainty: A nested decomposition approach. IEEE Trans. Power Syst.; 2017; 33, pp. 3559-3572. [DOI: https://dx.doi.org/10.1109/TPWRS.2017.2774367]

7. Aguado, J.; de La Torre, S.; Triviño, A. Battery energy storage systems in transmission network expansion planning. Electr. Power Syst. Res.; 2017; 145, pp. 63-72. [DOI: https://dx.doi.org/10.1016/j.epsr.2016.11.012]

8. Dvorkin, Y.; Fernández-Blanco, R.; Wang, Y.; Xu, B.; Kirschen, D.S.; Pandžić, H.; Watson, J.P.; Silva-Monroy, C.A. Co-planning of investments in transmission and merchant energy storage. IEEE Trans. Power Syst.; 2017; 33, pp. 245-256. [DOI: https://dx.doi.org/10.1109/TPWRS.2017.2705187]

9. Zhang, X.; Conejo, A.J. Coordinated investment in transmission and storage systems representing long-and short-term uncertainty. IEEE Trans. Power Syst.; 2018; 33, pp. 7143-7151. [DOI: https://dx.doi.org/10.1109/TPWRS.2018.2842045]

10. Nikoobakht, A.; Aghaei, J. Integrated transmission and storage systems investment planning hosting wind power generation: Continuous-time hybrid stochastic/robust optimisation. IET Gener. Transm. Distrib.; 2019; 13, pp. 4870-4879. [DOI: https://dx.doi.org/10.1049/iet-gtd.2019.0257]

11. Wang, S.; Geng, G.; Jiang, Q. Robust co-planning of energy storage and transmission line with mixed integer recourse. IEEE Trans. Power Syst.; 2019; 34, pp. 4728-4738. [DOI: https://dx.doi.org/10.1109/TPWRS.2019.2914276]

12. Gan, W.; Ai, X.; Fang, J.; Yan, M.; Yao, W.; Zuo, W.; Wen, J. Security constrained co-planning of transmission expansion and energy storage. Appl. Energy; 2019; 239, pp. 383-394. [DOI: https://dx.doi.org/10.1016/j.apenergy.2019.01.192]

13. Luburić, Z.; Pandžić, H.; Carrión, M. Transmission expansion planning model considering battery energy storage, TCSC and lines using AC OPF. IEEE Access; 2020; 8, pp. 203429-203439. [DOI: https://dx.doi.org/10.1109/ACCESS.2020.3036381]

14. Mazaheri, H.; Abbaspour, A.; Fotuhi-Firuzabad, M.; Moeini-Aghtaie, M.; Farzin, H.; Wang, F.; Dehghanian, P. An online method for MILP co-planning model of large-scale transmission expansion planning and energy storage systems considering N-1 criterion. IET Gener. Transm. Distrib.; 2021; 15, pp. 664-677. [DOI: https://dx.doi.org/10.1049/gtd2.12050]

15. de Oliveira, E.J.; de Paula, A.N.; de Oliveira, L.W.; Honório, L.d.M. Block-Based Multicut Benders Decomposition Algorithm for Transmission and Energy Storage Co-Planning. Int. Trans. Electr. Energy Syst.; 2022; 2022, [DOI: https://dx.doi.org/10.1155/2022/6289475]

16. Carrión, M.; Arroyo, J.M. A computationally efficient mixed-integer linear formulation for the thermal unit commitment problem. IEEE Trans. Power Syst.; 2006; 21, pp. 1371-1378. [DOI: https://dx.doi.org/10.1109/TPWRS.2006.876672]

17. Dillon, T.S.; Edwin, K.W.; Kochs, H.D.; Taud, R. Integer programming approach to the problem of optimal unit commitment with probabilistic reserve determination. IEEE Trans. Power Appar. Syst.; 1978; PAS-97, pp. 2154-2166. [DOI: https://dx.doi.org/10.1109/TPAS.1978.354719]

18. Arroyo, J.M.; Conejo, A.J. Optimal response of a thermal unit to an electricity spot market. IEEE Trans. Power Syst.; 2000; 15, pp. 1098-1104. [DOI: https://dx.doi.org/10.1109/59.871739]

19. Morales-España, G.; Latorre, J.M.; Ramos, A. Tight and compact MILP formulation for the thermal unit commitment problem. IEEE Trans. Power Syst.; 2013; 28, pp. 4897-4908. [DOI: https://dx.doi.org/10.1109/TPWRS.2013.2251373]

20. Subcommittee, P.M. IEEE reliability test system. IEEE Trans. Power Appar. Syst.; 1979; PAS-98, pp. 2047-2054. [DOI: https://dx.doi.org/10.1109/TPAS.1979.319398]

21. Ordoudis, C.; Pinson, P.; Morales, J.M.; Zugno, M. An Updated Version of the IEEE RTS 24-Bus System for Electricity Market and Power System Operation Studies; Technical University of Denmark: Kongens Lyngby, Denmark, 2016; Volume 13.

22. de Paula, A.N.; de Oliveira, E.J.; de Oliveira, L.W.; Honório, L.M. Robust static transmission expansion planning considering contingency and wind power generation. J. Control Autom. Electr. Syst.; 2020; 31, pp. 461-470. [DOI: https://dx.doi.org/10.1007/s40313-019-00556-w]

23. Fernández-Blanco, R.; Dvorkin, Y.; Xu, B.; Wang, Y.; Kirschen, D.S. Optimal energy storage siting and sizing: A WECC case study. IEEE Trans. Sustain. Energy; 2016; 8, pp. 733-743. [DOI: https://dx.doi.org/10.1109/TSTE.2016.2616444]

24. Merrick, J.H. On representation of temporal variability in electricity capacity planning models. Energy Econ.; 2016; 59, pp. 261-274. [DOI: https://dx.doi.org/10.1016/j.eneco.2016.08.001]

25. Nepomuce, L.; de Oliveira, E.; de Oliveira, L.; de Paula, A. Data for paper: A Novel Framework for Co-Expansion Planning of Transmission Lines and Energy Storage Devices Considering Unit Commitment. 2025; Available online: https://drive.google.com/drive/folders/1jJZeTsX8kTKbMI_zjHbBncBdxizD9wer?usp=drive_link (accessed on 21 May 2025).