Generation Expansion Equilibria with Predictive Dispatch Model
Sourabh Dalvi, David Biagioni, Muhammad Bashar Anwar, Gord Stephen and, Bethany Frew

TL;DR
This paper introduces a predictive modeling approach to efficiently solve generation expansion equilibrium problems in electricity markets, capturing market dynamics with reduced computational effort.
Contribution
It presents a novel methodology combining predictive models with bi-level optimization and diagonalization algorithms for strategic generation investment decisions.
Findings
Achieves significant computational efficiency improvements.
Accurately captures market characteristics and dynamics.
Enables strategic investment analysis in electricity markets.
Abstract
This paper proposes a methodology to solve generation expansion equilibrium problems by using a predictive model to represent the equilibrium in a simplified network constrained electricity market. The investment problem for each generation company (Genco) is a bi-level problem with the investment decision made in the upper level and market clearing condition in the lower level, which traditionally is represented as a Mathematical Program with Equilibrium Constraint (MPEC). The predictive model is trained for estimating the system-wide revenues for each technology type across energy, ancillary services and capacity markets given the amount of technology-specific installed capacity on the grid. The profit maximization investment problem for each Genco is solved using a global search algorithm, which uses the predictive model to evaluate the objective function. To solve for the strategic…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsElectric Power System Optimization · Energy Load and Power Forecasting · Optimal Power Flow Distribution
