Optimization for Balanced Three-Phase Power Distribution Networks with Renewables and Storage in MATLAB.
Naive Brute Force Multi-Period OPF. A spatially decomposed, temporally brute-forced MPOPF has been implemented.
- Loss Minimization
| Variable Notation | Variable Description | Number of Variables | Nature of Constraint |
|---|---|---|---|
| Real Power flowing in branch | Nonlinear | ||
| Reactive Power flowing in branch | Nonlinear | ||
| Square of Magnitude of branch Current | Nonlinear | ||
| Square of Magnitude of node Voltage | Nonlinear | ||
| Battery State of Charge | Linear |
| Variable Notation | Variable Description | Number of Variables | Nature of Constraint |
|---|---|---|---|
| Reactive Power of DER (via inverter) | Linear1 | ||
| Charging Power of Battery | Linear | ||
| Discharging Power of Battery | Linear | ||
| Reactive Power of Battery (via inverter) | Linear1 |
| Variable Notation | Variable Description | Number of Variables | Nature of Constraint |
|---|---|---|---|
| Real Power Demand | Linear | ||
| Reactive Power Demand | Linear | ||
| Real Power of DER | Linear1 | ||
| Battery Initial State of Charge | Linear |
| Variable Notation | Variable Description | Cardinality |
|---|---|---|
| Set of all the nodes | ||
| Set containing all the branches | ||
| Set containing all the nodes containing DERs. |
||
| Set containing all the nodes containing Batteries. |
||
| Set containing all the time-periods | ||
| Denotes a node. |
||
| Denotes a branch connecting nodes |
||
| Denotes a time-period2. |
- Current modelling. Future modelling will incorporate reactive power as a non-linear function wrt maximum apparent power and real power. ↩
- Except when used as a superscript in denoting Battery SOC
$B^{t}_j$ ,$t$ refers to the average value of the variable within the time-period$t$ . For Battery SOC,$B^{t}_j$ refers to the value of SOC at the end of time-period$t$ . ↩
Related: You may also check out the Greedy Single Time Period Sequential OPF Model repo here. Temporal decomposition will be applied there later, after algorithm development.