Graph Convolutional Neural Networks for Optimal Power Flow Locational Marginal Price

  title={Graph Convolutional Neural Networks for Optimal Power Flow Locational Marginal Price},
  author={Adrian-Petru Surani and Rahul Sahetiya},
—The real-time electricity market with the integration of renewable energies and electric vehicles have been receiving significant attention recently. So far most of the literature addresses the optimal power flow (OPF) problem in the real- time electricity market context by iterative methods. However, solving OPF problems in real-time is challenging due to the high computational complexity by the iterative methods. Motivated by this fact, in this paper, we propose a Chebyshev Graph Convolutional… 

Figures from this paper

Learning Warm-Start Points For Ac Optimal Power Flow

    K. Baker
    Computer Science
    2019 IEEE 29th International Workshop on Machine Learning for Signal Processing (MLSP)
  • 2019
A multi-target approach is utilized to learn approximate voltage and generation solutions to ACOPF problems directly by only using network loads, without the knowledge of other network parameters or the system topology.

Learning Optimal Solutions for Extremely Fast AC Optimal Power Flow

    Ahmed S. ZamzamK. Baker
    Computer Science
    2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids (SmartGridComm)
  • 2020
A machine learning approach to optimize the real-time operation of electric power grids finds feasible solutions to the AC optimal power flow (OPF) problem with negligible optimality gaps, resulting in a significant decrease in computational burden for grid operators.

Novel Linearized Power Flow and Linearized OPF Models for Active Distribution Networks With Application in Distribution LMP

A new distribution LMP (DLMP) formulation is presented which includes reactive power prices and voltage constraints, and the proposed DLMPs calculated with LF-D and LOPF-D give accurate price information if compared with the prices from ACOPF.

Learning the LMP-Load Coupling From Data: A Support Vector Machine Based Approach

It is shown that even without the knowledge of system topology and parameters, the SPRs can be estimated by learning from historical load and price data, and a Support Vector Machine based data-driven approach is proposed.

Distribution Locational Marginal Pricing for Optimal Electric Vehicle Charging Management

The case study results show that the integrated DLMP methodology can successfully alleviate the congestion caused by EV loads and it is shown that the socially optimal charging schedule can be implemented through a decentralized mechanism where loads respond autonomously to the posted DLMPs by maximizing their individual net surplus.

Impact of Data Quality on Real-Time Locational Marginal Price

It is shown that the power system state space is partitioned into price regions of convex polytopes and under different bad data models, the worst case impacts of bad data on real-time LMP are analyzed.

History of Optimal Power Flow and Formulations

The purpose of this paper is to present a literature review of the AC Optimal Power Flow (ACOPF) problem and propose areas where the ACOPF could be improved. The ACOPF is at the heart of Independent

Marginal loss modeling in LMP calculation

This paper discusses the pricing of marginal transmission network losses in the locational marginal pricing approach recently deployed in the ISO New England (ISO-NE) standard market design (SMD)

A market mechanism for electric distribution networks

    Na Li
    2015 54th IEEE Conference on Decision and Control (CDC)
  • 2015
This paper presents a decentralized market mechanism for a radial distribution network which internalize the externalities within private decisions and shows that a competitive market could be established for distribution services and electricity to achieve a social optimum within a power pool.

Learning for Constrained Optimization: Identifying Optimal Active Constraint Sets

A streaming algorithm that learns the relevant active sets from training samples consisting of the input parameters and the corresponding optimal solution, without any restrictions on the problem type, problem structure or probability distribution of theinput parameters is proposed.