Content area

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.

Details

1009240
Business indexing term
Title
A Novel Framework for Co-Expansion Planning of Transmission Lines and Energy Storage Devices Considering Unit Commitment
Publication title
Volume
13
Issue
6
First page
241
Number of pages
19
Publication year
2025
Publication date
2025
Publisher
MDPI AG
Place of publication
Basel
Country of publication
Switzerland
e-ISSN
22277080
Source type
Scholarly Journal
Language of publication
English
Document type
Journal Article
Publication history
 
 
Online publication date
2025-06-11
Milestone dates
2025-03-17 (Received); 2025-06-09 (Accepted)
Publication history
 
 
   First posting date
11 Jun 2025
ProQuest document ID
3223943034
Document URL
https://www.proquest.com/scholarly-journals/novel-framework-co-expansion-planning/docview/3223943034/se-2?accountid=208611
Copyright
© 2025 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Last updated
2025-06-25
Database
ProQuest One Academic