A Machine Learning-Enhanced Benders Decomposition Approach to Solve the Transmission Expansion Planning Problem under Uncertainty
The necessary decarbonization efforts in energy sectors entail the integration of flexibility assets, as well as increased levels of uncertainty for the planning and operation of power systems. To cope with this in a cost-effective manner, transmission expansion planning (TEP) models need to incorporate progressively more details to represent potential long-term system developments and the operation of power grids with intermittent renewable generation. However, the increased modeling complexities of TEP exercises can easily lead to computationally intractable optimization problems. Currently, most techniques that address computational intractability alter the original problem, thus neglecting critical modeling aspects or affecting the structure of the optimal solution. In this paper, we propose an alternative approach to significantly alleviate the computational burden of large-scale TEP problems. Our approach integrates machine learning (ML) with the well-established Benders decomposition to manage the problem size while preserving solution quality. The proposed ML-enhanced Multicut Benders Decomposition algorithm improves computational efficiency by identifying effective and ineffective optimality cuts via supervised learning techniques. We illustrate the benefits of the proposed methodology by solving a number of multi-stage TEP problems of different sizes, based on the IEEE24 and IEEE118 test systems, while also considering energy storage investment options.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Accelerating L-shaped Two-stage Stochastic SCUC with Learning Integrated Benders Decomposition
Benders decomposition is widely used to solve large mixed-integer problems. This paper takes advantage of machine learning and proposes enhanced variants of Benders decomposition for solving two-stage stochastic security…
regressionMassively Parallel Benders Decomposition for Correlation Clustering
We tackle the problem of graph partitioning for image segmentation using correlation clustering (CC), which we treat as an integer linear program (ILP). We reformulate optimization in the ILP so as to admit efficient opt…
Clusteringgraph partitioningImage SegmentationSemantic SegmentationPrivacy-Preserving Collaborative Operation of Networked Microgrids with the Local Utility Grid Based on Enhanced Benders Decomposition
Abstract—In this paper, a privacy-preserving decision-making the framework is developed for a collaborative operation of networked microgrids and the local utility grid, where the distribution system operator (DSO) int…
Decision MakingPrivacy PreservingvalidThe Proxy Benders Decomposition
Benders decomposition is a fundamental framework for solving large-scale mixed-integer optimization problems with complicating variables that, when fixed, yield significantly easier subproblems. However, classical Bender…
Resource-constrained Project Scheduling with Time-of-Use Energy Tariffs and Machine States: A Logic-based Benders Decomposition Approach
In this paper, we investigate the Resource-Constrained Project Scheduling Problem (RCPSP) with Time-of-Use (TOU) energy tariffs and machine states, a variant of RCPSP for production scheduling, where energy price is part…