Return to search results
ARPA-E Grid Optimization (GO) Competition Challenge 1
The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public.
Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition.
Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found.
For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below.
Complete Metadata
| @type | dcat:Dataset |
|---|---|
| accessLevel | public |
| bureauCode |
[
"019:20"
]
|
| contactPoint |
{
"fn": "Stephen Elbert",
"@type": "vcard:Contact",
"hasEmail": "mailto:steve.elbert@pnnl.gov"
}
|
| dataQuality |
true
|
| description | The ARPA-E Grid Optimization (GO) Competition Challenge 1, from 2018 to 2019, focused on the basic Security Constrained AC Optimal Power Flow problem (SCOPF) for a single time period. The Challenge utilized sets of unique datasets generated by the ARPA-E GRID DATA program. Each dataset consisted of a collection of power system network models of different sizes with associated operating scenarios (snapshots in time defining instantaneous power demand, renewable generation, generator and line availability, etc.). The datasets were of two types: Real-Time, which included starting-point information, and Online, which did not. Week-Ahead data is also provided for some cases but was not used in the Competition. Although most datasets were synthetic and generated by GRIDDATA, a few came from industry and were only used in the Final Event. All synthetic Input Data and Team Results for the GO Competition Challenge 1 for the Sandbox, Trial Events 1 to 3, and the Final Event along with problem, format, scoring and rules descriptions are available here. Data for industry scenarios will not be made public. Challenge 1, a minimization problem, required two computational steps. Solver 1 or Code 1 solved the base SCOPF problem under a strict wall clock time limit, as would be the case in industry, and reported the base case operating point as output, which was used to compute the Objective Function value that was used as the scenario score. The feasibility of the solution was provided by the Solver 2 or Code 2, which solves the power flow problem for all contingencies based on the results from Solver 1. This is not normally done in industry, so the time limits were relaxed. In fact, there were no time limits for Trial Event 1. This proved to be a mistake, with some codes running for more than 90 hours, and a time limit of 2 seconds per contingency was imposed for all other events. Entrants were free to use their own Solver 2 or use an open-source version provided by the Competition. Containers, such as Docker, were considered to improve the portability of codes, but none that could reliably support a multi-node parallel computing environment, e.g., MPI, could be found. For more information on the competition and challenge see the "GO Competition Challenge 1 Information" and "GO Competition Challenge 1 Additional Information" resources below. |
| distribution |
[
{
"@type": "dcat:Distribution",
"title": "ARPA-E Grid Optimization GO Competition Challenge 3",
"format": "HTML",
"accessURL": "https://data.openei.org/submissions/5997",
"mediaType": "text/html",
"description": "Full information and data for Challenge 3.
"
},
{
"@type": "dcat:Distribution",
"title": "ARPA-E Grid Optimization GO Competition Challenge 2",
"format": "HTML",
"accessURL": "https://data.openei.org/submissions/6197",
"mediaType": "text/html",
"description": "Full information and data for Challenge 2.
"
},
{
"@type": "dcat:Distribution",
"title": "GO Competition Final Report",
"format": "HTML",
"accessURL": "https://doi.org/10.2172/2404530",
"mediaType": "text/html",
"description": "Supporting ARPA-E Power Grid Optimization (Final Report)."
},
{
"@type": "dcat:Distribution",
"title": "GO Competition Challenge 1 Information",
"format": "HTML",
"accessURL": "https://gocompetition.energy.gov/challenges/challenge-1",
"mediaType": "text/html",
"description": "The link has a description of GO Competition Challenge 1, problem overview, and associated papers. The competing teams and prizes can be found under the "Leaderboards" section. "
},
{
"@type": "dcat:Distribution",
"title": "GO Competition Additional Info.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "Additional information about the ARPA-E Power Grid Optimization project.",
"downloadURL": "https://data.openei.org/files/6153/GO%20Competition%20Additional%20Info.pdf"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Dataset Format.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "Describes the Challenge 1 Dataset zip file structure. Challenge 1 uses a set of 4 ASCII encoded text files for the input data of each problem instance:
1. Power Flow Network Configuration Data File (case.raw).
2. Cost Function Data File (case.rop).
3. Participation Factor Data File (case.inl).
4. Contingency Description Data File (case.con).
These 4 files are formatted according to some common data file formats used in the power system industry. Only some of the fields in the files are used for Challenge 1. Appendix A of the Challenge 1 Problem Formulation document provides a detailed description of these formats and which of those elements are used by Challenge 1. Each network folder also contains a readme.txt, input.ini, and sometimes a check.txt file.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Dataset_Format.pdf"
},
{
"@type": "dcat:Distribution",
"title": "GO Competition Challenge 1 Additional Info.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "PDF containing additional information about the datasets, scoring, and events not included on the GO Competition Challenge 1 webpage. ",
"downloadURL": "https://data.openei.org/files/6153/Challenge%201%20Additional%20Info.pdf"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Scoring.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "The Challenge 1 Rules Document PDF dated October 13, 2018, explains the eligibility requirements and restrictions for awards to Entrants. This covers the technological approach, team members (including minors), registration, awards, intellectual property, use of proprietary software, trademarks, and additional information. Also discussed are scope and precedence and general conditions including both Entrant and Government Representations and Warranties, personally identifiable information, relationship of the parties, and trademark license.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Scoring.pdf"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Problem Formulation.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "The final version of the Problem Formulation was released April 9, 2019, and is 82 pages long with 211 equations. This document describes in detail the problem to be solved in Challenge 1 using the datasets in this archive. It also describes the dataset format. The Challenge 1 problem is a type of a security-constrained (AC based) optimal power flow, or SCOPF. The basic features of this SCOPF problem are the following:
1. An alternating current (AC) formulation.
2. Security constraints.
3. Pre-contingency (base-case) operational constraints and post-contingency operational constraints.
4. Preventive and corrective actions.
5. Transmission (line/transformer) contingency modeling and the corresponding.
6. Generator contingency modeling.
7. Bus-branch model.
8. Load modeling (more information to come).
9. Some constraint violations are included in the objective function.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Problem_Formulation.pdf"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event 4 PNNL Scenarios.tar.gz",
"format": "gz",
"mediaType": "application/gzip",
"description": "The tarball created April 17, 2020, contains all the Offline and Real-Time scenarios for networks Network_03-200_S0700_20190923, Network_08-373_S3000_20190923, Network_09-064_S5000_20190923, Network_09-195_S5000_20190923, and Network_70-422_S2000_20190923 created by PNNL.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_4_PNNL_Scenarios.tar.gz"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event 4 TAMU Scenarios.tar.gz",
"format": "gz",
"mediaType": "application/gzip",
"description": "The tarball created April 17, 2020, contains all the Week-Ahead, Offline and Real-Time scenarios for networks Network_02-173-tgo500_20190828, Network_06-124-tgo2000_20190828, Network_13-103-tgo10K_20191010, Network_30_048-tgo30K_20191003, Network_02_T2, Network_06_T2, Network_13_T2, and Network_30_T2 created by TAMU.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_4_TAMU_Scenarios.tar.tar.gz"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event 4 UW-Madison Scenarios.tar.gz",
"format": "gz",
"mediaType": "application/gzip",
"description": "The tarball created April 17, 2020, contains all the Week-Ahead, Offline and Real-Time scenarios for networks Network_11_T2, Network_20_T2, Network_82-010_UW-NEISOV6-4601_20191011, Network_86_T2, Network_12-050_UW-WIILIAMN-8718-8754-9591_20191105, Network_25-060_UW-LA2ND-24464_20191025, Network_82-040_UW-NEISOV9-3970_20191011, Network_88-030_UW-HVWIILIAMN-4837_20191106, Network_14-050_UW-105TX2ND4U-10480-20191009, Network_75-040_UW-ALMS44-2743_20190829, Network_83-130_UW-TNKYL3-4020_20190709_SWREM0, Network_15_T2 Network_76_T2, and Network_86-040_UW-MOLAAR-4619_20191017 created by UW-Madison.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_4_UW-Mad_Scenarios.tar.gz"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 2 TAMU Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from August 20, 2019, contains three sets (Real-Time, Offline, and Week-Ahead) from 4 networks: Network_02O-074_t1500_20190601-1, Network_02O-074_t1500_20190601-2, Network_02O-090_t1500_20190401, Network_02R-074_t1500_20190601-1, Network_02R-074_t1500_20190601-2, Network_02R-090_t1500_20190401, Network_06O-113_t102k_20190401, Network_06R-113_t102k_20190401, Network_06W-113_t102k_20190401, Network_13O-015_t110k_20190601, Network_13O-088_t110k_20190401, Network_13R-015_t110k_20190601, Network_13R-088_t110k_20190401, Network_13W-015_t110k_20190601, Network_13W-088_t110k_20190401, Network_30O-025_t130k_20190601, Network_30O-044_t130k_20190401, Network_30R-025_t130k_20190601, Network_30R-044_t130k_20190401, Network_30W-025_t130k_20190601, Network_30W-044_t130k_20190401. The second field in the name is the network number and type (Offline, Real-Time, or Week-Ahead), the third is the number of scenarios, the fourth (after t1) is the number of buses (500, 2000, 10000, or 30000) and the fifth is the date received from the Texas A&M University (TAMU) GRIDDATA team. Some of the scenarios are also in the Original Dataset 1 and Trial Event 1 and 2 datasets. The Week-Ahead datasets were not used in the Challenge 1.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_2_TAMU_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 2 UW-Madison Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from August 20, 2019, contains three sets (Real-Time, Offline, and Week-Ahead) from 7 networks: Network_11O-056_UW-9kLA2MN-8k_20190728, Network_11R-056_UW-9kLA2MN-8k_20190728, Network_11W-056_UW-9kLA2MN-8k_20190728, Network_15O-010_UW-TX2ND-11612_20190715, Network_15O-030_UW-TX2ND-11615_20190725, Network_15R-010_UW-TX2ND-11612_20190715, Network_15R-030_UW-TX2ND-11615_20190725, Network_15W-010_UW-TX2ND-11612_20190715, Network_15W-030_UW-TX2ND-11615_20190725, Network_20O-100_UW-LA2MN-19402_20190718, Network_20R-100_UW-LA2MN-19402_20190718, Network_20W-100_UW-LA2MN-19402_20190718, Network_76O-080_UW-ALMSV2-2755_20190709, Network_76R-080_UW-ALMSV2-2755_20190709, Network_76W-080_UW-ALMSV2-2755_20190709, Network_83O-130_UW-TNKYL3-4020_20190709_SWREM0, Network_83R-130_UW-TNKYL3-4020_20190709_SWREM0, Network_83_T2-120 (Network_83O-130_UW-TNKYL3-4020_20190709_SWREM0, Network_83R-130_UW-TNKYL3-4020_20190709_SWREM0, Network_83W-130_UW-TNKYL3-4020_20190709_SWREM0), Network_83W-130_UW-TNKYL3-4020_20190709_SWREM0, Network_86O-050_UW-MOLAAR-4619_20190715, Network_86R-050_UW-MOLAAR-4619_20190715, Network_86W-050_UW-MOLAAR-4619_20190715. The second field in the name is the network number and type (Offline, Real-Time, or Week-Ahead), the third is the number of scenarios, the fourth (after UW-source) is the number of buses (2755, 4020, 4619, 8000, 11612, 11615, or 19402) and the fifth is the date received from the University of Wisconsin-Madison GRIDDATA team. Datasets ending in SWREM0 had non-zero switched shunt values that were removed from the original.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_2_UW-Mad_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 2 PNNL Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from August 20, 2019, contains two sets (Real-Time and Offline) from 5 networks: Network_03O-200_S0700_20190625, Network_03R-200_S0700_20190625, Network_08O-373_S3000_20190625, Network_08R-373_S3000_20190625, Network_09O-064_S5000_20190625, Network_09O-196_S5000_20190710, Network_09R-064_S5000_20190625, Network_09R-196_S5000_20190710, Network_70O-422_S2000_20190625, Network_70R-422_S2000_20190625. The second field in the name is the network number and type (Offline or Real-Time), the third is the number of scenarios, the fourth is the number of buses (700, 2000, 3000, or 5000) and the fifth is the date received from the PNNL SDET GRIDDATA team. This data was intended for use in Event 2 but was not among the actual selected data found in Challenge_1_Trial_Event 2_Used_Scenarios.zip",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_2_PNNL_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 2 Used Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from August 20, 2019, contains two sets (Real-Time and Offline) of 140 scenarios (280 total), 10 for each of 14 networks. The names of the Network Models are Network_02* (500-bus from TAMU), Network_03* (793-bus from PNNL), Network_06* (2000-bus from TAMU), Network_70* (2312-bus from PNNL), Network_76* (2755-bus from UWM), Network_08* (3022-bus, from PNNL), Network_83* (4020-bus from UWM), Network_86* (4519-bus from UWM), Network_09* (4918-bus from PNNL), Network_11* (8733- to 8466-bus from UWM), Network_13* (10000-bus, from TAMU), Network_15* (11612- to 11615-bus from UWM), Network_20* (18877- to 19402-bus from UWM), and Network_30* (30000-bus, from TAMU). See Challenge 1 Dataset Format.pdf for details about the structure of the file. See Challenge 1 Event 2 Results Summary.xlsx for the results of all 27 teams participating in Trial Event 2.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_2_Used_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event Offline Synthetic Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from December 3, 2019, contains the Real-Time set of 340 scenarios, 20 for each of 17 networks. The names of the Network Models are Network_02O-173 (500-bus, 693-761 contingencies from TAMU), Network_03O-200 (793-bus, 85-100 contingencies from PNNL), Network_06O-124 (2000-bus, 2421-2535 contingencies from TAMU), Network_70O-422 (2312-bus, 982-1037 contingencies from PNNL), Network_75O-040 (2742-bus, 2151-2163 contingencies from UWM), Network_08O-373 (3022-bus, 1877-1972 contingencies from PNNL), Network_82O-010 (3970- and 4601-bus, 2491-2528 contingencies from UWM), Network_83O-130 (4020-bus, 3003-3033 contingencies from UWM), Network_86O-040 (4619-bus, 3026-3061 contingencies from UWM), Network_88O-030 (4836- and 4837-bus 3429-3435 contingencies from UWM), Network_09O-195 (4918-bus, 5072-5080 contingencies from PNNL), Network_12O-050 (8718-, 8754-, and 9591-bus, 5001-5303 contingencies from UWM), Network_13O-103 (10000-bus, 8893-9677 contingencies from TAMU), Network_14O-050 (10480-bus, 8553-8566 contingencies from UWM), Network_20O-100 (18877- to 19402-bus, 13157-13392 contingencies from UWM), Network_25O-060 (24464- and 24465-bus, 3699-3703 contingencies from UWM), Network_30R-048 (30000-bus, 10810-21960 contingencies from TAMU). See Challenge 1 Dataset Format.pdf for details about the structure of the file. Please use this citation in any publication where this data is used: ARPA-E Grid Optimization Competition (December 2019) Challenge 1 Final Event Dataset, doi: 10.17041/drp/1479685.
From https://dtn2.pnl.gov/arpacomp/F1/Challenge_1_Final_Event_Offline.zip
/pic/projects/goc/submission-manager/C1_data/Challenge_1_Final_Offline: 21 networks; 2,254 scenarios.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_Offline_Synthetic_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event Real-Time Synthetic Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from December 3, 2019, contains the Real-Time set of 340 scenarios, 20 for each of 17 networks. The names of the Network Models are Network_02R-173 (500-bus, 693-761 contingencies from TAMU), Network_03R-200 (793-bus, 85-100 contingencies from PNNL), Network_06R-124 (2000-bus, 2421-2535 contingencies from TAMU), Network_70R-422 (2312-bus, 982-1037 contingencies from PNNL), Network_75R-040 (2742-bus, 2151-2163 contingencies from UWM), Network_08R-373 (3022-bus, 1877-1972 contingencies from PNNL), Network_82R-010 (3970- and 4601-bus, 2491-2528 contingencies from UWM), Network_83R-130 (4020-bus, 3003-3033 from UWM), Network_86R-040 (4619-bus, 3026-3061 contingencies from UWM), Network_88R-030 (4836- and 4837-bus, 3429-3435 contingencies from UWM), Network_09R-195 (4918-bus, 5072-5080 contingencies from PNNL), Network_12R-050 (8718-, 8754-, and 9591-bus, 5001-5303 contingencies from UWM), Network_13R-103 (10000-bus, 8893-9677 contingencies from TAMU), Network_14R-050 (10480-bus, 8553-8566 contingencies from UWM),Network_20R-100 (18877- to 19402-bus, 13157-13392 contingencies from UWM), Network_25R-060 (24464- and 24465-bus, 3699-3703 contingencies from UWM), Network_30R-048 (30000-bus, 10810-21960 contingencies from TAMU). See Challenge 1 Dataset Format.pdf for details about the structure of the file. Note: the readme.txt for Network_88R-030 is incorrect; the correct values are in Network_88O-030 in the Offline version. Please use this citation in any publication where this data is used: ARPA-E Grid Optimization Competition (December 2019) Challenge 1 Final Event Dataset.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_Real-Time_Synthetic_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 1 All Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from July 18, 2024, contains two sets (Real-Time and Offline) of 718-scenarios prepared for Event 1. Only a subset (see Challenge 1 Trial Event 1 Used Scenarios) was used in scoring Challenge 1 results. Included here are an additional 55 Network_06O-055 scenarios.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_1_All_Scenrios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Event 1 Results.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from June 6, 2019, contains the detailed run result spreadsheets from all 22 teams that participated in Trial Event 1. Also included is D2_D4_39-Scenario_Leaderboard_Scores.xlsx and Trial_1_scores.xlsx (all the Trial 1 scores without the run details). Runs were made using 718 Division 1 scenarios, but time ran out (there was no time limit for code 2 runs, a mistake corrected in subsequent Events) before finishing all 22 teams (12 teams were finished for Division 1). For scoring, a subset of 39 scenarios each for Division 1 (Real-Time) and Division 2 (Offline) were used.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Event_1_Results.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Original Dataset 1 Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from March 22, 2019, contains 5 network models with 10 scenarios each in two forms: Real-Time and Online (a total of 100 scenarios). These two parts are the same except for the base case operating point. This point is represented by 5 variables (bus voltage magnitude in pu, VM; bus voltage angle in degrees, VA; generator real power output, PG; generator reactive power output, QG; and initial switched shunt susceptance, BINT) described in Appendix D.4 of the Challenge 1 Problem Formulation. These variables are mapped to the raw file in Appendices C.3 (Bus Data; A2.2), C.6 (Generator Data; A2.5), and C.9 (Switched Shunt Data, A2.8). This information can be used as a starting point for various algorithms. In general, we make no assertion of feasibility or optimality for this starting point. We make no assertion of feasibility for the Offline version but the Real-Time version, which is derived from an economical unconstrained solution, should be feasible but not optimal. Network_01 is a 500-bus model from TAMU, Network_03 is a 793-bus model from PNNL, Network_05 is a 2000-bus model from TAMU (v1), Network_07 is a 2312 model from PNNL, and Network_10 is a 7977-bus model from UW-M. The files in both parts are the same except for the raw files, which contain the starting information variables VM, VA, PG, QG, and BINT. Associated with each scenario instance are four case files (case.con, case.inl, case.raw, case.rop). Two of the case files change with each scenario instance (case.con and case.raw; also case.inl for Network_10*-10). These are kept in the scenario_n folders (n is 1 to 10). Case files that do not change (case.inl, except for Network_10-10, and case.rop) are kept in the network folder. The file inputfiles.ini in the network folder summarizes where each type of case file is to be found. Within each network folder is a readme.txt file with network configuration information (the number of buses, loads, generators, transformers, contingencies, etc.) and an explanation of inputfiles.ini. See Challenge 1 Dataset Format.pdf for details about the structure of the files. ",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Original_Dataset_1_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Original Dataset 2 Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from March 25, 2019, contains 4 network models with 20 scenarios each (except Network_05R-010, which only has 10), in two forms: Real-Time and Online (a total of 140 scenarios). Network_01 is a 500-bus model from TAMU, Network_03 a 793-bus model from PNNL, Network_05 a 2000-bus model from TAMU (v1), and Network_07 a 2312 model from PNNL. These network models are the same as the ones with the same name in the Challenge 1 Original Dataset 1, but with different scenario instances. See Challenge 1 Original Dataset 1 Scenarios for additional information. See Challenge 1 Dataset Format.pdf for details about the structure of the files. ",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Original_Dataset_2_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 1 Used Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from May 21, 2019, contains two sets (Real-Time and Offline) of 39-scenarios used for scoring Event1, a subset of the full 718 Trial Event 1 scenarios, 3 for each of 13 networks. All 718 scenarios were run for Division 1 for some teams but not all and none for Division2. The reason for the reduced scope was a consequence of not requiring a time limit for performing contingency power flow calculations. This lack of a time limit was removed in subsequent events, but to complete the scoring in event 1 the number of scenarios used needed to be reduced. The names of the Network Models are Network_01?-3 (500-bus, 349-422 contingencies from TAMU), Network_02?-3 (500-bus, 784-786 contingencies from TAMU), Network_03?-3 (793-bus, 86-97 contingencies from PNNL), Network_05?-3 (2000-bus, 3139-3189 contingencies from TAMU), Network_06?-3 (2000-bus, 2595-2619 contingencies from TAMU), Network_07?-3 (2312-bus, 942-1015 contingencies from PNNL), Network_70?-3 (2312-bus, 1008-1015 contingencies from PNNL), Network_08?-3(3013-bus, 1957-1978 contingencies from PNNL), Network_81?-3 (3288-bus, 4563-4650 contingencies from UWM), Network_84?-3 (4601-bus, 7075-7094 contingencies from UWM), Network_09?-3 (4918-bus, 5058-5085 contingencies from PNNL), Network_12?-3 (9591-bus, 4377 contingencies from UWM), and Network_13?-3 (10000-bus, 9519-9622 contingencies from TAMU), where the question mark symbol (?) can be either R for R-Time (used with Division 1 or 3) or O for Offline (used with Division 2 or 4). The "-3" indicates the Network Model has 3 scenarios. See Challenge 1 Dataset Format.pdf for details about the structure of the file. ",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_1_Used_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Trial Event 3 Scenarios.zip",
"format": "zip",
"mediaType": "application/zip",
"description": "The zip file from September 27, 2019, contains two sets (Real-Time and Offline) of 30 scenarios (60 total), 5 for each of 6 networks. The names of the Network Models are Network_09* (4918-bus, 5052-5074 contingencies from PNNL), Network_11* (8466- to 8733-bus, 11157-11864 contingencies from UWM), Network_13* (10000-bus, 6603-9004 contingencies from TAMU), Network_15* (11612- to 11615-bus, 8653-8747 contingencies from UWM), Network_20* (18877- to 19402-bus, 13157-13392 contingencies form UWM), and Network_30* (30000-bus, 10810 contingencies from TAMU). See Challenge 1 Dataset Format.pdf for details about the structure of the file. See Challenge 1 Event 3 Results Summary.xlsx for the results of all 25 teams participating in Trial Event 3.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Trial_Event_3_Scenarios.zip"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event 4 Scenario Difficulty Analysis.pdf",
"format": "pdf",
"mediaType": "application/pdf",
"description": "This Presentation was made by Stephen Elbert (PNNL) with the help of Hans Mittelmann (ASU) at the 2020 FERC Technical Conference: Increasing Real-Time and Day-Ahead Market Efficiency and Enhancing Resilience through Improved Software on June 25, 2020.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_4_Scenario_Difficulty_Analysis.pdf"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Final Event 4 Scenario Characteristics.csv",
"format": "csv",
"mediaType": "text/csv",
"description": "This csv file has the columns: Network Model, Scenario, Buses, Loads, Fixed Shunts, Generators, Nontransformer Branches, Transformers, Areas, Switched Shunts, Contingencies, Slack Score. There is one row for each of the 340 scenarios (17 networks with 20 scenarios each). ",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Final_Event_4_Scenario_Characteristics.csv"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Event 4 Final Scenario Results.xlsx",
"format": "xlsx",
"mediaType": "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
"description": "This spreadsheet from May 24, 2021, contains the detailed run results from all 26 teams that participated in Challenge 1 Final Event (4). The Results tab has 25,552 rows (340 synthetic plus 12 industry scenarios x 26 teams x 2 divisions (18,304) + 7,247 reruns + header) and 40 columns. There are 8 other tabs including C1 Final Event Rankings.",
"downloadURL": "https://data.openei.org/files/6153/C1_E4_scenario_results_20200106.xlsx"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Event 3 Results Summary.xlsx",
"format": "xlsx",
"mediaType": "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
"description": "This spreadsheet from November 1, 2019, contains the detailed run results from all 25 teams that participated in Challenge 1 Trial Event 3. The Results tab has 1561 rows (60 scenarios x 26 teams [GMI-GO is included twice, once for Divisions 1 and 2 and once for Divisions 3 and 4—same results but different scoring] + header) and 38 columns. There are 9 other tabs including Trial 3 Rankings.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Event_3_Results_Summary.xlsx"
},
{
"@type": "dcat:Distribution",
"title": "Challenge 1 Event 2 Results Summary.xlsx",
"format": "xlsx",
"mediaType": "application/vnd.openxmlformats-officedocument.spreadsheetml.sheet",
"description": "This spreadsheet from October 2, 2019, contains the detailed run results from all 27 teams that participated in Challenge 1 Trial Event 2. The Results tab has 16,241 rows (140*2 scenarios * 2 (duplicate) *29 teams (Clemson & GMI-GO are listed twice) plus header) and 34 columns. There are 12 other tabs including Trial 2 Rankings.",
"downloadURL": "https://data.openei.org/files/6153/Challenge_1_Event_2_Results_Summary.xlsx"
}
]
|
| DOI | 10.25984/2437761 |
| identifier | https://data.openei.org/submissions/6153 |
| issued | 2024-08-05T06:00:00Z |
| keyword |
[
"ACOPF",
"ARPA-E",
"GO Competition",
"Unit Commitment",
"competition",
"computational science",
"data",
"energy",
"energy model",
"grid",
"grid optimization",
"model",
"optimal powerflow",
"optimization",
"power",
"security constrained",
"synthetic grid data"
]
|
| landingPage | https://data.openei.org/submissions/6153 |
| license | https://creativecommons.org/licenses/by/4.0/ |
| modified | 2024-09-27T19:03:49Z |
| programCode |
[
"019:000",
"019:023"
]
|
| projectNumber | CJ0000903 |
| projectTitle | ARPA-E Grid Optimization Competition |
| publisher |
{
"name": "Pacific Northwest National Laboratory",
"@type": "org:Organization"
}
|
| spatial |
"{"type":"Polygon","coordinates":[[[-167.7267,13.518],[-53.8316,13.518],[-53.8316,75.0714],[-167.7267,75.0714],[-167.7267,13.518]]]}"
|
| title | ARPA-E Grid Optimization (GO) Competition Challenge 1 |