Benchmarks for the Optimal Power Flow Problem

Overview

Power Grid Lib - Optimal Power Flow

This benchmark library is curated and maintained by the IEEE PES Task Force on Benchmarks for Validation of Emerging Power System Algorithms and is designed to evaluate a well established version of the the AC Optimal Power Flow problem. This introductory video and detailed report present the motivations and goals of this benchmark library. In particular, these cases are designed for benchmarking algorithms that solve the following Non-Convex Nonlinear Program,

  The Mathematical Model of the Optimal Power Flow Problem  

A detailed description of this mathematical model is available here. All of the cases files are curated in the MATPOWER data format. Open-source reference implementations are available in MATPOWER and PowerModels.jl and baseline results are reported in BASELINE.md.

Problem Variants

These cases may also be useful for benchmarking the following variants of the Optimal Power Flow problem,

  • DC Optimal Power Flow
  • AC Optimal Transmission Switching
  • DC Optimal Transmission Switching

That said, these cases are curated with the AC Optimal Power Flow problem in mind. Application to other domains and problem variants should be done with discretion.

Case File Overview

A forthcoming technical report will detail the sources, motivations, and procedures for curating these case files.

In this repository the network data files are organized into the following three broad groups:

  • /*.m - base case benchmarks as originally specified
  • /api/*.m - heavily loaded test cases (i.e. binding thermal limit constraints)
  • /sad/*.m - small phase angle difference cases (i.e. binding phase angle difference constraints)

Contributions

All case files are provided under a Creative Commons Attribution License, which allows anyone to share or adapt these cases as long as they give appropriate credit to the orginal author, provide a link to the license, and indicate if changes were made.

Community-based recommendations and contributions are welcome and encouraged in all PGLib repositories. Please feel free to submit comments and questions in the issue tracker. Corrections and new network contributions are welcome via pull requests. All data contributions are subject to a quality assurance review by the repository curator(s).

Citation Guidelines

This repository is not static. Consequently, it is critically important to indicate the version number when referencing this repository in scholarly work.

Users of this these cases are encouraged to cite the original source documents that are indicated in the file headers and the achrive report.

Comments
  • DC Baselines, Constraints, and Inf

    DC Baselines, Constraints, and Inf

    Hello, I have some related questions about the DC OPF baselines.

    1. It seems that for many of the typical operating conditions, the DC approximation better minimizes the cost than the full AC solution. Is this expected? Does this factor in any constraint violations?

    2. In some of the small angle difference cases, the objective values for the DC approximation are listed as "Inf". Does that indicate a constraint violation?

    opened by ElPiloto 5
  • radial test cases

    radial test cases

    It seems none of the test cases in pglib-opf are radial? That makes it hard to use any of these benchmarks to use/extend them for models that require a consistent definition of upstream/downstream, e.g. as in [1] below.

    I recall that the NESTA archive had a /rad m file collection. Was there any discussion on including that in pglib-opf? What happened to it?

    [1] Dvorkin, V., Fioretto, F., Van Hentenryck, P., Kazempour, J., & Pinson, P. (2020). Differentially Private Optimal Power Flow for Distribution Grids, 1, 1–9. Retrieved from http://arxiv.org/abs/2004.03921

    opened by frederikgeth 5
  • Help In SDP-Relaxation method for solving OPF Problem

    Help In SDP-Relaxation method for solving OPF Problem

    Hello Sir, i came to know about you from your videos of Convex Relaxations in Youtube... Sir i need help from you, i am stuck in my project work....i am trying to find an optimze a system 3m9b for test....

    and i wrote the optimization problem like this.... for i=1:1 cvx_begin cvx_solver sedumi

    variables u(npv,1) variable W(2n,2n) symmetric summ=trace(YYreal(:,:,1)*W); for i=2:n summ=summ+trace(YYreal(:,:,i)*W); end for i=1:npv u(i,1)==trace(YYreal(:,:,i+npq)W);
    (This u contais the PV buses active power generation...(whose optimal value has to be found)) end minimize(w
    (sum(u)+trace(YYreal(:,:,n)*W)))

    subject to for i=1:npq (this are equality constraints "calculated active power=specified active power" for pv&pq buses) trace(YYreal(:,:,i)*W)-(Pg(i,1)-Pl(i,1))==0; trace(YYreal(:,:,i)*W)-(Pg(i,1)-Pl(i,1))==0; end for i=1:npv (this bounds i thought to apply after getting a local optimal solution from Newtons Method) trace(YYreal(:,:,i+npq)*W)+Pl(i+npq,1)>=-0.2 trace(YYreal(:,:,i+npq)*W)+Pl(i+npq,1)<=3 end

    for i=1:npq (this are equality constraints "calculated reactive power=specified reactive power" for only pq buses) trace(YYimag(:,:,i)*W)-(Qg(i,1)-Ql(i,1))==0; trace(YYimag(:,:,i)*W)-(Qg(i,1)-Ql(i,1))==0; end

    W==semidefinite(2*n); W>=0; cvx_end w=w+1 for i=1:npv Pg(i+npq,1)=trace(YYreal(:,:,i+npq)*W)+Pl(i+npq,1); end end

    Sir, in the paper it is "Zero Duality Gap In Optimal Power Flow" that rank of W matrix variable should come=1 when the duality gap is "0". and for that we applied weight method.(w is the weight)..

    Sir.. for some values of w i get solution as 'NAN'. and for some i get an optimal solution...but the 'W matrix' never comes of rank 1...

    i dont know where i am going wrong...but please help me with this....

    opened by 12146 1
  • Line limits units (`rateA`)

    Line limits units (`rateA`)

    Hi, first, thanks for your work aggregating and building this library!

    I'm trying to use the 1354pegase case and am implementing my own simplified opf model where I want to impose line current constraints for line l = (i,j) according to

    (|y_ij| |V_i - V_j|)^2 <= rhs
    

    for V_i, V_j the complex voltages at buses i and j and |y_ij| is the magnitude of the (i,j) element of the admittance matrix. (Btw, I'm ignoring tap adjustments now...)

    However, I'm not sure what the units of the rhs should be from the pglib case. According to Table V of the report (https://arxiv.org/abs/1908.02788), it seems that rateA is a thermal limit that was determined by the TL-UB method from Section V.B.2. Does this mean that the rateA is already normalized by baseMVA and given in p.u. form? Or should I divide rateA by 100 to get the p.u. (and then square it to set the value of the rhs).

    Thanks!

    opened by jacob-roth 1
  • Tranformer Parameter Checks

    Tranformer Parameter Checks

    In some cases all tap settings are 1.0, I check should be made so that this only occurs when the value is not 1.0 or the branch is connecting two voltage levels.

    opened by ccoffrin 1
  • Inverted Generator Bounds

    Inverted Generator Bounds

    Some inactive generators have infeasible active power bounds (i.e. pmax < pmin). Resolve this by ensuring,

    pmin = min(pmin,pmax)
    pmax = min(pmin,pmax)
    

    in all generators.

    opened by ccoffrin 0
  • Generator LB higher than UB in 1888_rte__api

    Generator LB higher than UB in 1888_rte__api

    In pglib_opf_case1888_rte__api.m, the real power lower bound for the generator at bus 1689 (line 2,044 of the `.m' file) is 280.0, but the upper bound has been modified to be 64 (from 930 in the original case). Is this intentional? If so, what does it mean if the generator is turned on?

    Thank you for your help!

    opened by emma58 2
  • Error when solving case89_pegase__api and case240_pserc__api

    Error when solving case89_pegase__api and case240_pserc__api

    Hello,

    I got the following error when solving OPF for 2 test cases: case89_pegase__api and case240_pserc__api with the MATPOWER function runopf. It seems that there is a problem when generator bound Pmax is 0.

    Error using makeAvl (line 52) makeAvl: either Qmin or Qmax must be equal to zero for each dispatchable load.

    Error in opf_setup (line 171) [Avl, lvl, uvl] = makeAvl(baseMVA, gen);

    Error in opf (line 198) om = opf_setup(mpc, mpopt);

    Error in runopf (line 75) [r, success] = opf(casedata, mpopt);

    Best regards,

    Christian

    opened by cbingane 7
  • Add 68-Bus System

    Add 68-Bus System

    Explore the possibility of including a network derived from the 68-Bus, 16-Machine, 5-Area Dynamic Test System.

    Related Links:

    • http://sites.ieee.org/pes-psdp/benchmark-systems-2/
    • https://electricgrids.engr.tamu.edu/electric-grid-test-cases/
    • http://icseg.iti.illinois.edu/new-england-68-bus-test-system/
    • http://sites.ieee.org/pes-resource-center/files/2015/08/PES_TR18_Benchmark-Systems-for-Small-Signal-Stability-Analysis-and-Control.pdf
    • http://www.sel.eesc.usp.br/ieee/NETS68/New_England_New_York_68_Bus_System_study_report.pdf
    opened by ccoffrin 0
Releases(v21.07)
Owner
A Library of IEEE PES Power Grid Benchmarks
A Library of IEEE PES Power Grid Benchmarks
Official code for "Distributed Deep Learning in Open Collaborations" (NeurIPS 2021)

Distributed Deep Learning in Open Collaborations This repository contains the code for the NeurIPS 2021 paper "Distributed Deep Learning in Open Colla

Yandex Research 96 Sep 15, 2022
MVGCN: a novel multi-view graph convolutional network (MVGCN) framework for link prediction in biomedical bipartite networks.

MVGCN MVGCN: a novel multi-view graph convolutional network (MVGCN) framework for link prediction in biomedical bipartite networks. Developer: Fu Hait

13 Dec 01, 2022
Source codes for the paper "Local Additivity Based Data Augmentation for Semi-supervised NER"

LADA This repo contains codes for the following paper: Jiaao Chen*, Zhenghui Wang*, Ran Tian, Zichao Yang, Diyi Yang: Local Additivity Based Data Augm

GT-SALT 36 Dec 02, 2022
Implementation of FitVid video prediction model in JAX/Flax.

FitVid Video Prediction Model Implementation of FitVid video prediction model in JAX/Flax. If you find this code useful, please cite it in your paper:

Google Research 62 Nov 25, 2022
Model Serving Made Easy

The easiest way to build Machine Learning APIs BentoML makes moving trained ML models to production easy: Package models trained with any ML framework

BentoML 4.4k Jan 08, 2023
Python and Julia in harmony.

PythonCall & JuliaCall Bringing Python® and Julia together in seamless harmony: Call Python code from Julia and Julia code from Python via a symmetric

Christopher Rowley 414 Jan 07, 2023
This is a official repository of SimViT.

SimViT This is a official repository of SimViT. We will open our models and codes about object detection and semantic segmentation soon. Our code refe

ligang 57 Dec 15, 2022
Rotary Transformer

[中文|English] Rotary Transformer Rotary Transformer is an MLM pre-trained language model with rotary position embedding (RoPE). The RoPE is a relative

325 Jan 03, 2023
Cognate Detection Repository

Cognate Detection Repository Details This repository contains the data for two publications: Challenge Dataset of Cognates and False Friend Pairs from

Diptesh Kanojia 1 Apr 26, 2022
Learning based AI for playing multi-round Koi-Koi hanafuda card games. Have fun.

Koi-Koi AI Learning based AI for playing multi-round Koi-Koi hanafuda card games. Platform Python PyTorch PySimpleGUI (for the interface playing vs AI

Sanghai Guan 10 Nov 20, 2022
CO-PILOT: COllaborative Planning and reInforcement Learning On sub-Task curriculum

CO-PILOT CO-PILOT: COllaborative Planning and reInforcement Learning On sub-Task curriculum, NeurIPS 2021, Shuang Ao, Tianyi Zhou, Guodong Long, Qingh

Shuang Ao 1 Feb 18, 2022
All of the figures and notebooks for my deep learning book, for free!

"Deep Learning - A Visual Approach" by Andrew Glassner This is the official repo for my book from No Starch Press. Ordering the book My book is called

Andrew Glassner 227 Jan 04, 2023
Autonomous Driving on Curvy Roads without Reliance on Frenet Frame: A Cartesian-based Trajectory Planning Method

C++/ROS Source Codes for "Autonomous Driving on Curvy Roads without Reliance on Frenet Frame: A Cartesian-based Trajectory Planning Method" published in IEEE Trans. Intelligent Transportation Systems

Bai Li 88 Dec 23, 2022
A script helps the user to update Linux and Mac systems through the terminal

Description This script helps the user to update Linux and Mac systems through the terminal. All the user has to install some requirements and then ru

Roxcoder 2 Jan 23, 2022
Tianshou - An elegant PyTorch deep reinforcement learning library.

Tianshou (天授) is a reinforcement learning platform based on pure PyTorch. Unlike existing reinforcement learning libraries, which are mainly based on

Tsinghua Machine Learning Group 5.5k Jan 05, 2023
Prefix-Tuning: Optimizing Continuous Prompts for Generation

Prefix Tuning Files: . ├── gpt2 # Code for GPT2 style autoregressive LM │ ├── train_e2e.py # high-level script

530 Jan 04, 2023
Federated learning on graph, especially on graph neural networks (GNNs), knowledge graph, and private GNN.

Federated learning on graph, especially on graph neural networks (GNNs), knowledge graph, and private GNN.

keven 198 Dec 20, 2022
The official implementation of the Interspeech 2021 paper WSRGlow: A Glow-based Waveform Generative Model for Audio Super-Resolution.

WSRGlow The official implementation of the Interspeech 2021 paper WSRGlow: A Glow-based Waveform Generative Model for Audio Super-Resolution. Audio sa

Kexun Zhang 96 Jan 03, 2023
Object tracking using YOLO and a tracker(KCF, MOSSE, CSRT) in openCV

Object tracking using YOLO and a tracker(KCF, MOSSE, CSRT) in openCV File YOLOv3 weight can be downloaded

Ngoc Quyen Ngo 2 Mar 27, 2022
The spiritual successor to knockknock for PyTorch Lightning, get notified when your training ends

Who's there? The spiritual successor to knockknock for PyTorch Lightning, to get a notification when your training is complete or when it crashes duri

twsl 70 Oct 06, 2022