DC-OPF Test Case
This is a test case in ODM-format for Optimal Power Flow(OPF ) study, strictly speaking,for DC-OPF at this early stage.
- Original data
- topology diagram
- power flow data
NAME 3NodeCase
UNIT SI
BASE_S 100
BASE_V 10
// SI (International System of Units) such as MW
// PU (Per Unit)
// Source: Shahidehpour, Yamin and Li (2002), "Market Operations in Electric
// Power Systems: Forecasting, Scheduling, and Risk Management,"
// John Wiley, IEEE, page 297, Table 8.2-8.4
DemandType
PriceSensitiveNone
BranchData
//From To lineCap reactance
1 2 55 0.20
1 3 55 0.40
2 3 55 0.25
GenData
//ID atNode
1 1
2 2
3 3
LSEDataFixedDemand
//ID atNode LP-00
1 1 132.66
2 2 44.22
3 3 44.22
- supplementary data for OPF
//NN penaltyCoeff
3 0.05
GenData
//ID atNode FCost a b capL capU initMoney
1 1 142.735 10.694 0.00463 20 200 10000
2 2 218.335 18.1 0.00612 10 150 10000
3 3 118.821 37.8896 0.01433 5 20 10000
- ODM-format data
The ODM/OPF schema can be found here
The corresponding ODM-format xml file can be found here.
- map ODM/OPF to InterPSS Object model
An ODM/OPF mapper is developed to map the ODM-format OPF data to InterPSS OpfNetwork object. Now this operation is included in IEEEODMMaper
- running OPF with InterPSS
1) A dc-opf algorithm, based on the open source, Java, Quadratic Programming Solver——QuadProgJ, is implemented with InterPSS APIs. The source codes are here
2) A test case( code ) is run to test the developed algorithm with the data provided above, and the result is verified against what is originally done with QuadProgJ by Jie Li,etc(more reference)
3) Test result:
---DCOPF SOLUTION RESULT SUMMARY---
----------------------------------------------------
busID isOpfGen optimGen(PU) optimAngle(RAD)
----------------------------------------------------
Bus1 True 2.000 0.00
Bus2 True 0.161 -0.08
Bus3 True 0.050 -0.11
----------------------------------------------------
Minimun Total Variable Cost: 26.215
Minimun Total Cost: 506.106