| Full text | |
| Author(s): |
Skolfield, J. Kyle
;
Escobar, Laura M.
;
Escobedo, Adolfo R.
Total Authors: 3
|
| Document type: | Journal article |
| Source: | ANNALS OF OPERATIONS RESEARCH; v. 312, n. 2, p. 19-pg., 2022-03-16. |
| Abstract | |
This paper seeks to solve the long-term transmission expansion planning problem in power systems more effectively by reducing the solution search space and the computational effort. The proposed methodology finds and adds cutting planes based on structural insights about bus angle differences along paths. Two lemmas and a theorem are proposed which formally establish the validity of these cutting planes onto the underlying mathematical formulations. These path-based bus angle difference constraints, which tighten the relaxed feasible region, are used in combination with branch-and-bound to find lower bounds on the optimal investment of the transmission expansion planning problem. This work also creates an algorithm that automates the process of finding and applying the most effective valid inequalities, resulting in significantly reduced testing and computational time. The algorithm is implemented in Python, using Gurobi to add constraints and solve the exact DCOPF-based transmission expansion problem. This paper uses two different-sized systems to illustrate the effectiveness of the proposed framework: the GOC 500-bus system and a modified Polish 2383-bus system. (AU) | |
| FAPESP's process: | 15/21972-6 - Optimization of the operation and planning in transmission and distribution systems |
| Grantee: | Rubén Augusto Romero Lázaro |
| Support Opportunities: | Research Projects - Thematic Grants |