## Datasets

Please use this dataset for your initial submission to verify that you are producing valid forms of the files solution1.txt and solution2.txt used for scoring. This dataset contains only one scenario while all other datasets contain multiple scenarios (up to 100) so please make sure this one is being processed correctly before attempting the others.The results of this submission will not be visible on the leaderboard, only to the individual/team that made the submission. An example of the information returned from the GO Competition Reference GAMs submission for this dataset is available here, a 66 kB tar.gz file. Note: some of the information in the tar.gz file is specific to the Reference GAMS implementation.

Filename |
Available Formats |
---|---|

Phase 0: IEEE 14 Bus (1 Scenario) |
.zip (15.2 KB) |

Filename |
Available Formats |
---|---|

Phase 0 : RTS96springwday_1 (100 scenarios) |
.zip (10.3 MB) |

Phase 0 : Modified RTS96springwday_1 (100 scenarios) |
.zip (9.75 MB) |

Phase 0 : IEEE 14 Bus (100 scenarios) |
.zip (1.41 MB) |

Phase 0 : Modified IEEE 14 Bus (100 scenarios) |
.zip (1.43 MB) |

Phase 0 : 179 Bus (10 feasible scenarios) | .zip (12.0 MB) |

Phase 0 : 179 Bus (10 infeasible scenarios) | .zip (12.7 MB) |

Phase 0 : Original Dataset (105 Scenarios) |
Coming Very Soon |

At the root level of each zip file is the *scorepara.csv* file that contains the dataset name and scoring parameters. For more details on these parameters, pleas see the scoring section:

- Nominal time value,
*t*: seconds to complete the longest included scenario in a power systems network model with the reference GAMS algorithm, rounded up a whole single digit_{nom.,A} - Nominal objective value, c
: maximum objective across scenarios in a power systems network model with the reference GAMS algorithm, rounded up a whole single digit)_{nom.,A} - Time scale: when multiplied by
*t*this gives the scenario dependent threshold,_{nom.,A, }*t*_{A,i} - Constraint violation penalty scale: when multiplied by c
, this gives the score, y_{nom.,A}, when constraints are violated or an algorithm times-out_{A,i} - Time violation penalty scale: when multiplied by
*t*, this gives the score, x_{nom.,A}, when an algorithm returns a solution in time greater than_{A,i}*t*_{A,i} - Maximum infeasibility: constraint violations that exceed this value are not considered satisfied
- Number of scenarios associated with each power systems network model in the dataset

Each dataset contains 1 or more scenario folders, and each scenario contains the following files:

- powersystem.raw
- generator.csv
- contingency.csv
- pscopf_data.gms
- pscopf_data.mat
- pscopf.m
- solution1.txt (in Phase 0 datasets only)
- solution2.txt (in Phase 0 datasets only)

**powersystem.raw** is a PSSE Raw file version 33.5, containing bus, generator, load, branch, transformer, and other control variable data for a power system. Raw files may contain other data not relevant to the SCOPF problem.

**generator.csv** is a comma separated value (csv) file. The headers are Bus Number, Generator ID, Term ID, and Value. The generation cost is a quadratic function, the constant term has Term ID 0, the linear term with ID 1, and the quadratic term has ID 2. Term ID 9 is for participation factor of a generation. The cost data and participation factor are NOT per unit. Default value of the field "Value" is 0.0.

The first 4 lines (out of 235) of rts96_gencost.csv are:

Bus Number,Generator ID,Term ID,Value 101,1,0,1375.9 101,1,1,140.3842614 101,1,2,2.082286932 101,1,9,5

This means the cost function of generator 1 linked to bus 101 is $1375.9+140.3843 p + 2.082287 p^2$, where $p$ is active power in MW. The participation factor is 5.0.

**contingency.csv **provides a list of contingencies. The headers are Contingency ID, Type, From, and To. The first field provides the index for each contingency. These indices will be used in the standard output file of solutions. Field "Type" identifiers are B for branch, T for transformer and G for generator. For Type B, fields "From" and "To" are the indices of the end buses of the failed branch. For Type T, fields "From" and "To" are the indices of the end buses of the failed transformer. For Type G, field "To" is the index of the failed generator and "From" is the index of the bus to which the failed generator is connected.

A contingency list includes all contingencies to be considered in a SCOPF-PF problem. Each line represents a single contingency.

All 11 lines (10 contingencies) of contingecy1.csv are:

Contingency ID,Type,From,To,CID 1,B,101,102,1 2,B,106,110,1 3,B,111,114 ,1 4,B,116,117 ,1 5,B,121,122 ,1 6,B,205,210 ,1 7,B,216,219 ,1 8,B,312,323 ,1 9,B,317,322 ,1 10,B,325,121 ,1

**pscopf_data.gms** contains the same data from the first three files, but in GAMS compatible format.

**pscopf_data.mat **contains the same data from the first three files, but in MATLAB binary format.

**pscopf.m **contains the same data from the first three files, but in MATLAB compatible format.

**solution1.txt** contains the required output for the base solution described under Evaluation.

**solution2.txt** contains the required output for the contingency solutions described under Evaluation.

*Please note*: The solution1.txt and solution2.txt files are included in the dataset for demonstration purposes **only for Beta Testing Phase (Phase 0)**. They will not be included during competitive phases.

**Phase 0: IEEE 14-Bus (1 scenario)**

The IEEE 14-bus test case is a model of the American Electric Power System in 1962. IEEE14 has had many additions over the years: line limits, generator costs, etc. For the PSCOPF problem, a few security contingencies were defined. This is one of the feasible scenarios generated by random perturbation of some of the limits (e.g. on generator power output and branch flows). This problem is small enough that it should not pose any challenge to off-the-shelf optimization solvers, commercial or otherwise.

This should be the dataset used with your first submission. Unlike the other datasets, it consists of only a single scenario so any error, i.e., in creating solution files, is not repeated multiple times. The results are not tracked on the leaderboard. Only the person who made the submission, and their team, can see the results. Once you have recieved a score for this dataset equal to the objective value of your solution (the reference value is 2,912,857.26) you are ready to submit multiple scenario datasets.

**Phase 0: IEEE 14-Bus (100 scenarios)**

This dataset uses the same power system network model for the IEEE 14-bus system as above but is composed of 100 scenarios, all known to be feasible, generated by random perturbation of some of the limits (e.g. on generator power output and branch flows). These problems are small enough that they should not pose any challenge to off-the-shelf optimization solvers, commercial or otherwise.

**Phase 0: Modified IEEE 14-Bus (100 scenarios)**

This dataset uses a modified power system network model based the IEEE 14-bus system mentioned above. The modification consists of removing one line, linking buses 7 and 9. The 100 scenarios, all known to be feasible, were generated by random perturbation of some of the limits (e.g. on generator power output and branch flows). These problems are small enough that they should not pose any challenge to off-the-shelf optimization solvers, commercial or otherwise.

**Phase 0: RTS96 (100 scenarios)**

This dataset is composed of 100 scenarios, all known to be feasible, based on the 1996 update (“The IEEE Reliability Test System - 1996”, IEEE Transactions on Power Systems, Vol. 14, No. 3, August 1999) of the IEEE Reliability Test System, originally published in 1979. The scenarios were generated by random perturbations of some of the limits (e.g. on generator power output and branch flows) taken from the spring windy day 1 data.

**Phase 0: Modified RTS96 (100 scenarios)**

This dataset is composed of 100 scenarios, all known to be feasible, based on the 1996 update (“The IEEE Reliability Test System - 1996”, IEEE Transactions on Power Systems, Vol. 14, No. 3, August 1999) of the IEEE Reliability Test System, originally published in 1979, modified by removing one line, linking buses 121 and 325, in order to generate a distinct power system network model. The scenarios were generated by random perturbations of some of the limits (e.g. on generator power output and branch flows) taken from the spring windy day 1 data..

**Phase 0: Feasible 179-Bus (10 scenarios)**

This dataset is composed of 10 scenarios, all known to be feasible, based on the 179-bus model of the Western Systems Coordinating Council (WECC/WSCC) developed at the University of Wisconsin – Madison ("DC Multi-infeed Study," Electric Power Res. Inst. TR-104586, Dec. 1994.) For this dataset special emphasis was placed on generating a large set of security contingencies, with scenarios generated by random perturbations of some of the limits (e.g. on generator power output and branch flows).

**Phase 0: Infeasible 179-Bus (10 scenarios)**

This dataset is composed of 10 scenarios based on the 179 bus model of the Western Systems Coordinating Council (WECC/WSCC) developed at the University of Wisconsin – Madison ("DC Multi-infeed Study," Electric Power Res. Inst. TR-104586, Dec. 1994.) For this dataset special emphasis was placed on generating a large set of security contingencies. Multiple scenarios were generated by random perturbation of limits, e.g. on generator power output and branch flows, and ten were selected has having no known feasible solution. Since the initial selection, scenarios 2, 3, and 4 have been shown to be feasible.

The reactive power balance constraint violations (pu) for each scenario observed by the GAMS reference solution are:

Scenario | Violation |
---|---|

1 | 108.3277324034 |

2 | 2.065E-7 |

3 | 5.18E-8 |

4 | 1.222E-7 |

5 | 112.3874869845 |

6 | 107.5294907679 |

7 | 9.4938630426 |

8 | 11.8842477458 |

9 | 99.4814837677 |

10 | 119.8815277648 |

A solution is considered feasible if the maximum constraint violation is less than 1.00E-6.

The purpose of this dataset is to challenge solvers. Solvers that find feasible solutions to the scenarios currently considered infeasible are considered noteworthy. Solvers that can recognize infeasible solutions and quit early are also noteworthy.