2016/12/20 by Raphael Canyasse, Canyasse, Raphael, Gal Dalal +3 · 1 citation
Engineering · #FOS: Computer and information sciences #Machine Learning (cs.LG) #Optimal Power Flow Distribution #Power System Optimization and Stability #Power System Reliability and Maintenance
paper · pdf · doi:10.48550/arxiv.1612.06623
openalex publication_date 2016/12/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
In this work we design and compare different supervised learning algorithms to compute the cost of Alternating Current Optimal Power Flow (ACOPF). The motivation for quick calculation of OPF cost outcomes stems from the growing need of algorithmic-based long-term and medium-term planning methodologies in power networks. Integrated in a multiple time-horizon coordination framework, we refer to this approximation module as a proxy for predicting short-term decision outcomes without the need of actual simulation and optimization of them. Our method enables fast approximate calculation of OPF cost with less than 1% error on average, achieved in run-times that are several orders of magnitude lower than of exact computation. Several test-cases such as IEEE-RTS96 are used to demonstrate the efficiency of our approach.