Security-constrained robust dynamic power system planning with discrete recourse

Abstract

In this study, we present a two-stage robust optimization model for dynamic generation and transmission expansion planning considering discrete recourse decisions and n − K security constraints. Unlike the mainstream literature, our approach exactly considers cost non-convexities, binary commitment decisions, and security constraints. By customizing a nested column-and-constraint generation procedure, we compute this complex problem accurately. On two test systems, we illustrate the efficacy of the method and the impacts of security constraints, and the discreteness of recourse decisions on grid expansions. • A robust dynamic expansion planning model for co-optimizing generation capacity and transmission network. • Modeling uncertainty of demand, renewable generation, and outage status of power system components. • A decomposition method based on a nested column-and-constraint generation procedure.