A computationally efficient algorithm for computing convex hull prices. (January 2022)

• Record Type: Journal Article
• Authors: Knueven, Bernard; Ostrowski, James; Castillo, Anya; Watson, Jean-Paul
• Is Part Of: Computers & industrial engineering. Volume 163(2022)
• Publication Date: 2022-01
• Subjects: Convex hull pricing -- Electricity markets -- Unit commitment -- Benders decomposition -- Linear programming; Engineering -- Data processing -- Periodicals; Industrial engineering -- Periodicals; 620.00285
• DOI: 10.1016/j.cie.2021.107806
• Languages: English
• ISSNs: 0360-8352

Abstract

Highlights: Accurate pricing in scheduling problems is necessary for efficient markets. Efficient prices are possible due to recent advances in generator modeling. Prices can be computed in actionable time for industry scale problems. Abstract: Electricity markets worldwide allow participants to bid non-convex production offers. While non-convex offers can more accurately reflect a resource's capabilities, they create challenges for market clearing processes. For example, system operators may be required to execute side payments to participants whose costs are not covered through energy sales as determined via traditional locational marginal pricing schemes. Convex hull pricing minimizes this and other types of side payments while providing uniform (i.e., locationally and temporally consistent) prices. Computing convex hull prices involves solving either a large-scale linear program or the Lagrangian dual of the corresponding non-convex scheduling problem. Further, the former approach requires explicit descriptions of market participants' convex hulls. While linear programs for computing convex hull prices are large, their structure is naturally decomposable by generators. Here, we propose and empirically analyze a Benders decomposition approach to computing convex hull prices that leverages recent advances in convex hull formulations for thermal generating units. We demonstrate across a large set of test instances that our decomposition approach only requires modest computational effort, obtaining solutions at least an order of magnitude faster than the equivalent large-scale linear programming approach. Overall, we provide a computationally feasible method for computing convex hull prices for industrial scale market clearing problems, enabling the possibility of practical adoption of this advanced pricing mechanism.