This paper presents a mathematical model to solve the multi-stage transmission network expansion planning (MTNEP) problem considering renewable energy sources (RES) and the allocation of energy storage systems (ESSs). Given the stochastic nature of both renewable energy sources and demand, the implementation of representative periods (RPs) is proposed. RPs represent the behavior of the electrical power system over time series, including short-term variations, demand and RES correlations, and geographic factors, offering feasible computational complexity to solve the MTNEP problem. The proposed model is formulated as a deterministic equivalent mixed-integer linear programming (MILP) model for a set of RPs. The MILP model optimizes investments in transmission lines (TLs) and ESSs. Furthermore, the MILP model incorporates active power losses through piecewise linearization and N − 1 security constraints. A method is developed to reduce the combinatorial search space to deal with high-dimensional problems. The Garver’s 6-bus system, a modified IEEE 24-bus test system, and the northern Colombian transmission system are employed to validate the proposed model. An extensive analysis of the impact of RES and ESSs on MTNEP is presented. Simultaneous optimization of TLs and ESSs provides better and cheaper MTNEPs compared to traditional methods. The effectiveness of ESSs in integrating RES, shifting electricity, reducing / delaying investments (especially when considering N − 1 security constraints), and alleviating grid congestion is evidenced. This shows that ESSs have great potential as reinforcement and flexibility elements in the MTNEP problem.
The grid-connected sizing of a photovoltaic (PV) power plant system aims to determine the equipment and components necessary to operate and integrate PV panels into an on-grid system with compatibility, efficiency, affordability, and reliability. In this context, this article proposes a new three-stage optimization-based framework for the grid-connected sizing of a PV power plant. In Stage 1, the $k$-means clustering algorithm is utilized to determine the placement and dimensions of the inverters, as well as the number of strings and the arrangement of PV modules in strings. During Stage 2, the DC wiring is sized to facilitate the connection between the PV strings and the inverters. Finally, in Stage 3, the AC wiring is sized to connect the inverters to the power substation. Stages 2 and 3 are formulated as mixed-integer linear programming problems to minimize investment costs and reduce AC power losses. The framework is implemented using different tools and libraries, including Quantum Geographic Information System for geospatial panel placement, Python libraries such as scikit-learn for clustering, and Pyomo for modeling the optimization problem of Stages 2 and 3 with the Gurobi solver. A real-world case study of a PV power plant located in Brazil, which covers an area of 13 000 m$^{2}$ and a nominal power of 1.2 MW, is used to validate the proposed framework. The results demonstrate the robustness, feasibility, and scalability of the proposed methodology.