.png){kind=icon}
.png){kind=icon}
Return
Deterministic electric power infrastructure planning: Mixed-integer programming model and nested decomposition algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ejor.2018.05.039.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper addresses the long-term planning of electric power infrastructures considering high renewable penetration. To capture the intermittency of these sources, we propose a deterministic multi-scale Mixed-Integer Linear Programming (MILP) formulation that simultaneously considers annual generation investment decisions and hourly operational decisions. We adopt judicious approximations and aggregations to improve its tractability. Moreover, to overcome the computational challenges of treating hourly operational decisions within a monolithic multi-year planning horizon, we propose a decomposition algorithm based on Nested Benders Decomposition for multi-period MILP problems to allow the solution of larger instances. Our decomposition adapts previous nested Benders methods by handling integer and continuous state variables, although at the expense of losing its finite convergence property due to potential duality gap. We apply the proposed modeling framework to a case study in the Electric Reliability Council of Texas (ERCOT) region, and demonstrate massive computational savings from our decomposition. (C) 2018 Elsevier B.V. All rights reserved.
Keywords:
Strategic planning
OR in energy
Large-scale optimization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W