Rung 66: cycles per period — a line that comes in with the second period closes a triangle, under a security-constrained run that outages it¶
One rung of the PyPSA corpus: the file pypsa.yaml projected onto what this network builds, attached to that network, and held to what PyPSA solves it to.
✔ Verified against pypsa master at 3625c816 — objective 16000.0 on both sides; structure ✔ 8 constraints · 2 variables, name for name; size ✔ 62 rows · ✔ 18 columns · ✔ 86 nonzeros; duals ✔ 62 rows; model for model: 10 blocks equal, 0 documented splits, 1 recorded deviations.
Rows and columns, PyPSA against specsolve, name for name
| row | PyPSA | specsolve |
|---|---|---|
Bus-nodal_balance |
12 | 12 |
Generator-fix-p-lower |
8 | 8 |
Generator-fix-p-upper |
8 | 8 |
Kirchhoff-Voltage-Law |
2 | 2 |
Line-fix-s-lower |
10 | 10 |
Line-fix-s-lower-security-for-{c}-outage-in-sub-network-{n} |
6 | 6 |
Line-fix-s-upper |
10 | 10 |
Line-fix-s-upper-security-for-{c}-outage-in-sub-network-{n} |
6 | 6 |
| column | PyPSA | specsolve |
|---|---|---|
Generator-p |
8 | 8 |
Line-s |
10 | 10 |
The model¶
The same model, as math
The file states a plain n.optimize(), its multi-period class under the multi_investment_periods keyword, and its stochastic class, which n.set_scenarios(...) sets. Every quantity chosen once the future is known (second-stage) spans the futures dispatch is chosen in (scenario). Capacity is chosen once, before the future is known, and paid at its expected cost in each investment period its build year and lifetime span. Operation is the expectation over the scenarios' weights, with a share priced at the worst-outcome mean cost (CVaR) only where a risk preference is set. A plain run's data has one scenario, one period, unit weights, no outage and every active flag true, so the problem is the standard one. On a security-constrained run, PyPSA copies each branch flow limit once per outage, and the outage factors, active flags and scenario weights come from data prep.
Sets¶
| Symbol | Meaning |
|---|---|
| \(\mathcal{B}\) | index \(b\) — breakpoint — the corners of a piecewise-linear curve, in order. A curve runs over the breakpoints its data has rows for, so curves may differ in length |
| \(\mathcal{N}\) | index \(n\) — bus with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N},\ \mathrm{Line\_bus0}: \mathcal{K} \to \mathcal{N},\ \mathrm{Line\_bus1}: \mathcal{K} \to \mathcal{N},\ \mathrm{Link\_output\_bus}: \mathcal{O} \to \mathcal{N},\ \mathrm{Load\_bus}: \mathcal{D} \to \mathcal{N},\ \mathrm{Process\_output\_bus}: \mathcal{R} \to \mathcal{N}\) — network nodes |
| \(\mathcal{C}\) | index \(c\) — cycle — independent cycles of the passive network graph, the cycle basis, data prep. Each period has its own basis, of the branches that are active in it. A label is a position in that period's basis, so one label is a different cycle in another period |
| \(\mathcal{G}\) | index \(g\) — generator with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N}\) — generating units, each on one bus |
| \(\mathcal{K}\) | index \(k\) — line with \(\mathrm{Line\_bus0}: \mathcal{K} \to \mathcal{N},\ \mathrm{Line\_bus1}: \mathcal{K} \to \mathcal{N},\ \mathrm{Outage\_line}: \mathcal{K}^{\mathrm{out}} \to \mathcal{K}\), Outage_line is absent where the data has no row — passive branches, each between two buses, their flow set by impedance |
| \(\mathcal{L}\) | index \(l\) — link with \(\mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — controllable connections, each from one bus to the buses it delivers to |
| \(\mathcal{O}\) | index \(o\) — link_output with \(\mathrm{Link\_output\_bus}: \mathcal{O} \to \mathcal{N},\ \mathrm{Link\_output\_link}: \mathcal{O} \to \mathcal{L}\) — a link's output ports, one label per port a link declares. The labels are PyPSA's bus1, bus2, … columns read long, data prep. A link of any number of output ports is then one term in the balance |
| \(\mathcal{D}\) | index \(d\) — load with \(\mathrm{Load\_bus}: \mathcal{D} \to \mathcal{N}\) — demands, each on one bus |
| \(\mathcal{K}^{\mathrm{out}}\) | index \(\kappa\) — outage with \(\mathrm{Outage\_line}: \mathcal{K}^{\mathrm{out}} \to \mathcal{K},\ \mathrm{Outage\_transformer}: \mathcal{K}^{\mathrm{out}} \to \mathcal{M}\), Outage_line is absent where the data has no row, Outage_transformer is absent where the data has no row — the passive branches a security-constrained run takes out one at a time (PyPSA's branch_outages), each a line or a transformer. A plain run has none |
| \(\mathcal{Y}\) | index \(y\) — period with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — investment periods. It is PyPSA's investment_periods |
| \(\mathcal{J}\) | index \(j\) — process with \(\mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — generalised multi-port converters, each with an internal power that every port draws or delivers at its own rate |
| \(\mathcal{R}\) | index \(r\) — process_output with \(\mathrm{Process\_output\_bus}: \mathcal{R} \to \mathcal{N},\ \mathrm{Process\_output\_process}: \mathcal{R} \to \mathcal{J}\) — a process's ports, one label per port a process declares. The labels are PyPSA's bus0, bus1, …, each with a signed rate, data prep. A process of any number of ports is then one term in the balance |
| \(\Xi\) | index \(\xi\) — scenario — the futures dispatch is chosen in, each with a weight |
| \(\mathcal{T}\) | index \(t\) — snapshot with \(\mathrm{snapshot\_period}: \mathcal{T} \to \mathcal{Y}\) — dispatch periods |
| \(\mathcal{M}\) | index \(m\) — transformer with \(\mathrm{Outage\_transformer}: \mathcal{K}^{\mathrm{out}} \to \mathcal{M}\), Outage_transformer is absent where the data has no row — passive branches between two buses, their flow set by impedance and tap ratio, with a phase shift fixed or optimised |
Parameters¶
| Symbol | Meaning |
|---|---|
| \(\mathrm{Bus\_attached}\) | Bus_attached over \(\mathcal{N} \times \mathcal{T}\) — whether a load, a unit, a port or a branch that is active in the snapshot's period is attached to the bus, data prep. A bus nothing is attached to has no balance row |
| \(\mathrm{Cycle\_in\_basis}\) | Cycle_in_basis over \(\mathcal{C} \times \mathcal{Y}\) — whether a period's cycle basis reaches the cycle label, data prep. A label beyond the basis of the period has no Kirchhoff voltage law row |
| \(\mathrm{on}\) | Generator_active over \(\mathcal{G} \times \mathcal{T}\) — whether a generator is active in a snapshot's period. It is PyPSA's active, from build year and lifetime, data prep |
| \(\mathrm{act}\) | Generator_active_asset over \(\mathcal{G}\) — whether a generator is one of PyPSA's active_assets, by its active flag alone, without build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA refuses one that differs by scenario (constants.py:54) |
| \(\mathrm{com}\) | Generator_committable over \(\mathcal{G}\) — whether output is gated by an on/off status decision |
| \(\mathrm{c}\) | Generator_marginal_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of one unit of output |
| \(\mathrm{p}^{\mathrm{curve}}\) | Generator_marginal_cost_curve_p over \(\mathcal{B} \times \mathcal{G}\), absent where the data has no row — the output at each breakpoint of a generator's piecewise marginal_cost curve: PyPSA's p_pu breakpoints times p_nom, data prep. A generator with no curve has no rows |
| \(\mathrm{c}^{(2)}\) | Generator_marginal_cost_quadratic over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of output |
| \(\overline{\mathrm{p}}\) | Generator_p_max_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — most output, per unit of nominal power: an availability profile |
| \(\underline{\mathrm{p}}\) | Generator_p_min_pu over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — least output, per unit of nominal power |
| \(\mathrm{p}^{\mathrm{nom}}\) | Generator_p_nom over \(\mathcal{G} \times \Xi\) — nominal power |
| \(\mathrm{ext}\) | Generator_p_nom_extendable over \(\mathcal{G}\) — whether the nominal power is a decision |
| \(\mathrm{sgn}\) | Generator_sign over \(\mathcal{G}\) — the sign output enters its bus's balance with. It is PyPSA's sign, 1 unless given, -1 for a unit that draws power. PyPSA refuses one that differs by scenario (constants.py:46) |
| \(\beta\) | Line_BODF over \(\mathcal{K} \times \mathcal{K}^{\mathrm{out}} \times \mathcal{Y}\), absent where the data has no row — the share of an outaged branch's flow a line takes on when that branch goes out (PyPSA's BODF), data prep. It comes from the PTDF of the sub-network the period's active branches form. A row exists only where the line and the outage are active in the period and share a sub-network. It is -1 at the outaged line itself. PyPSA takes the factors of the first scenario (abstract.py:652), and refuses impedances that differ by scenario (constants.py:33-35). So the factors are the same in every scenario |
| \(\mathrm{on}^{s}\) | Line_active over \(\mathcal{K} \times \mathcal{T}\) — whether a line is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\mathrm{x}\) | Line_cycle_weight over \(\mathcal{C} \times \mathcal{K} \times \mathcal{Y}\), absent where the data has no row — the line's series impedance, signed by its orientation in the cycle: the cycle basis, data prep. A line in no cycle has no row. PyPSA builds the cycle basis from the first scenario (networks.py:1430-1437), and refuses a v_nom, x_pu_eff or r_pu_eff that differs by scenario (constants.py:33-35). So the weight is the same in every scenario |
| \(\overline{\mathrm{s}}\) | Line_s_max_pu over \(\mathcal{K} \times \Xi \times \mathcal{T}\) — most flow either way, per unit of nominal apparent power |
| \(\mathrm{s}^{\mathrm{nom}}\) | Line_s_nom over \(\mathcal{K} \times \Xi\) — nominal apparent power |
| \(\mathrm{ext}^{s}\) | Line_s_nom_extendable over \(\mathcal{K}\) — whether the nominal apparent power is a decision |
| \(\mathrm{on}^{f}\) | Link_active over \(\mathcal{L} \times \mathcal{T}\) — whether a link is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\eta\) | Link_efficiency over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — share of the flow that arrives at an output port, PyPSA's efficiency, efficiency2, … read long: negative where that port consumes rather than delivers. Read at the snapshot the flow arrives, so a delayed port delivers at its arrival snapshot's efficiency (constraints.py:1575) |
| \(\mathrm{cyc}^{f}\) | Link_output_cyclic_delay over \(\mathcal{O}\) — whether a delayed port's flow wraps from the end of its investment period (PyPSA's cyclic_delay, cyclic_delay2, …). Where it does not, the flow still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is |
| \(\mathrm{d}^{f}\) | Link_output_delay over \(\mathcal{O}\) — snapshots a port's delivery lags its link's flow (PyPSA's delay, delay2, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA refuses a delay that differs by scenario (constants.py:55) |
| \(\mathrm{on}^{\mathrm{load}}\) | Load_active over \(\mathcal{D}\) — whether a load is active in the network, PyPSA's active. A load has no build year and no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario (constants.py:54) |
| \(\mathrm{load}\) | Load_p_set over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — demand |
| \(\mathrm{sgn}^{\mathrm{load}}\) | Load_sign over \(\mathcal{D}\) — the sign a load's demand enters its bus's balance with. It is PyPSA's sign, -1 unless given, 1 for a load that feeds its bus. PyPSA refuses one that differs by scenario (constants.py:46) |
| \(\mathrm{on}^{z}\) | Process_active over \(\mathcal{J} \times \mathcal{T}\) — whether a process is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\mathrm{cyc}^{z}\) | Process_output_cyclic_delay over \(\mathcal{R}\) — whether a delayed port's transfer wraps from the end of its investment period (PyPSA's cyclic_delay0, cyclic_delay1, …). Where it does not, the energy still in transit at each period's first snapshots is lost. The flag is the same in every scenario, as the delay is |
| \(\mathrm{d}^{z}\) | Process_output_delay over \(\mathcal{R}\) — snapshots a port's transfer lags its process's internal power (PyPSA's delay0, delay1, … read long). In data prep you divide it by the snapshot_weightings.generators value and round it up. It is zero for a port that transfers at once. A port has the same delay in every scenario, as a link's port has |
| \(\alpha\) | Process_rate over \(\mathcal{R} \times \Xi \times \mathcal{T}\) — the energy a port draws or delivers per unit of internal power (PyPSA's rate0, rate1, … read long). It is negative where the port withdraws and positive where it injects. A link is a process whose bus0 rate is minus one and whose output rates are its efficiencies. The rate at the snapshot the transfer arrives applies, so a delayed port transfers at its arrival snapshot's rate (constraints.py:1575) |
| \(\mathrm{on}^{\sigma}\) | Transformer_active over \(\mathcal{T} \times \mathcal{M}\) — whether a transformer is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\mathrm{w}^{y}\) | period_weight_objective over \(\mathcal{Y}\) — PyPSA's investment_period_weightings.objective — what a period's cost weighs. PyPSA reads it only under multi_investment_periods. Otherwise you feed one in data prep, whatever the column contains (optimize.py:231-233, :293-297) |
| \(\pi\) | scenario_weight over \(\Xi\) — PyPSA's scenario_weightings.weight — the probability of a future |
| \(\mathrm{w}\) | snapshot_weightings_objective over \(\mathcal{T}\) — PyPSA's snapshot_weightings.objective — hours a snapshot weighs in the cost |
Conditions¶
| Symbol | Meaning |
|---|---|
| \(\mathrm{Generator\_marginal\_cost\_curve}\) | Generator_marginal_cost_curve over \(\mathcal{G}\) — a generator that pays along a piecewise marginal_cost curve: one of PyPSA's active_assets with curve data (optimize.py:307, piecewise.py:230-257) |
Variables¶
| Symbol | Meaning |
|---|---|
| \(C^{\mathrm{curve}}\) | Generator_marginal_cost_piecewise over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-marginal_cost_piecewise — the running cost of a generator that pays along a curve, held above the curve |
| \(p\) | Generator_p over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-p — output of a generator in a snapshot |
| \(s\) | Line_s over \(\mathcal{K} \times \Xi \times \mathcal{T}\) — Line-s — PyPSA's p0, the flow measured at the Line_bus0 end: a positive value withdraws there and injects at Line_bus1, lossless |
| \(f\) | Link_p over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — Link-p — PyPSA's p0, the flow measured at the Link_bus0 end. A positive value withdraws there and injects at every bus the link's output ports deliver to |
| \(z\) | Process_p over \(\mathcal{J} \times \Xi \times \mathcal{T}\) — Process-p — PyPSA's internal power p. A positive value drives every port at its own rate, withdrawing where the rate is negative and injecting where it is positive |
| \(\sigma\) | Transformer_s over \(\Xi \times \mathcal{T} \times \mathcal{M}\) — Transformer-s — PyPSA's p0, the flow measured at the Transformer_bus0 end: a positive value withdraws there and injects at Transformer_bus1, lossless |
Definitions¶
| Symbol | Meaning |
|---|---|
| \(\mathit{Bus\_injection}\) | Bus_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) — what every component puts into a bus, less what it takes out of it. PyPSA writes each term into the balance, and a load on its right-hand side |
| \(\mathit{Cycle\_angle\_sum}\) | Cycle_angle_sum over \(\mathcal{C} \times \Xi \times \mathcal{T}\) — the voltage angle differences around a cycle: every branch flow times its cycle weight, and every transformer phase shift |
| \(\mathit{Generator\_injection}\) | Generator_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Generator\_opex}\) | Generator_opex over \(\Xi\) |
| \(\mathit{Generator\_running\_cost}\) | Generator_running_cost over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — what a generator's output costs in a snapshot: the value read off its piecewise curve where it has one, and its linear marginal_cost otherwise. A curve replaces the linear cost, as PyPSA drops the unit from that term (optimize.py:333-348) |
| \(\mathit{Line\_angle\_sum}\) | Line_angle_sum over \(\mathcal{C} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Line\_injection}\) | Line_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Line\_s\_monitored}\) | Line_s_monitored over \(\mathcal{K} \times \Xi \times \mathcal{T}\) — the flow in a line's post-contingency rows. It is its flow where it is active, and nothing where it does not. PyPSA builds those rows for every branch of the sub-network in every snapshot |
| \(\mathit{Link\_injection}\) | Link_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Link\_output\_arrival}\) | Link_output_arrival over \(\mathcal{O} \times \Xi \times \mathcal{T}\) — what a link delivers to an output port at a snapshot. It is its flow delayed by the port's delay within its investment period. It is multiplied by the port's efficiency at the snapshot the flow arrives. Where the port is cyclic_delay, the delayed flow wraps from the period's end. Where it is not, the flow still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) delivers its flow unshifted, cyclic or not |
| \(\mathrm{Load\_demand}\) | Load_demand over \(\mathcal{D} \times \Xi \times \mathcal{T}\) — what a load draws from its bus's balance. It is its demand times its sign where it is active, and nothing where it is not. PyPSA drops an inactive load from the balance (constraints.py:1591-1592) |
| \(\mathrm{Load\_injection}\) | Load_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Outage\_s}\) | Outage_s over \(\mathcal{K}^{\mathrm{out}} \times \Xi \times \mathcal{T}\) — the flow an outage takes off its branch: the outaged line's or transformer's flow before it goes out |
| \(\mathit{Process\_injection}\) | Process_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Process\_output\_arrival}\) | Process_output_arrival over \(\mathcal{R} \times \Xi \times \mathcal{T}\) — what a process transfers at a port at a snapshot. It is its internal power delayed by the port's delay within its investment period. It is multiplied by the port's rate at the snapshot the transfer arrives. Where the port is cyclic_delay, the delayed transfer wraps from the period's end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port that does not delay (delay zero) transfers at once, cyclic or not |
| \(\mathit{Transformer\_s\_monitored}\) | Transformer_s_monitored over \(\Xi \times \mathcal{T} \times \mathcal{M}\) — the flow a transformer's post-contingency rows read, as a line's |
| \(\mathit{risk\_weighted\_opex}\) | risk_weighted_opex (scalar) |
| \(\mathit{scenario\_opex}\) | scenario_opex over \(\Xi\) — what a future costs to run: every operating term, weighted by the snapshot's hours and its period, before the scenario's own weight. A start and a stop cost what they cost, unweighted, as PyPSA adds them (optimize.py:448-468) |
| \(\mathit{total\_cost}\) | total_cost (scalar) — what the system costs. Capacity counts once per active period at its expected cost over the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail |
Notation¶
| Symbol | Meaning |
|---|---|
| \(t \ominus k\) | edge='wrap' — \(t-k\), cyclic |
| \(t \boxminus_{v} k\) | edge=v — \(t-k\), and \(v\) past the edge |
| \(t \ominus^{\mathrm{relation}(t)} k\) | within=relation[...] — \(t-k\) inside the group of \(t\) |
Conditions¶
Generator_marginal_cost_curve
Variable domains¶
Generator_marginal_cost_piecewise
Generator_p
Line_s
Link_p
Process_p
Transformer_s
Definitions¶
Bus_injection
Cycle_angle_sum
Generator_injection
Generator_opex
Generator_running_cost
Line_angle_sum
Line_injection
Line_s_monitored
Link_injection
Link_output_arrival
Load_demand
Load_injection
Outage_s
Process_injection
Process_output_arrival
Transformer_s_monitored
risk_weighted_opex
scenario_opex
total_cost
Objective¶
Subject to¶
Bus_nodal_balance
Generator_fix_p_lower
Generator_fix_p_upper
Kirchhoff_Voltage_Law
Line_fix_s_lower
Line_fix_s_lower_security
Line_fix_s_upper
Line_fix_s_upper_security
The spec, differential/pypsa/rungs/rung_66_cycles_per_period.yaml — the file projected onto what this rung builds:
version: 0
description: The file states a plain `n.optimize()`, its multi-period class under the `multi_investment_periods`
keyword, and its stochastic class, which `n.set_scenarios(...)` sets. Every quantity chosen once the
future is known (second-stage) spans the futures dispatch is chosen in (`scenario`). Capacity is chosen
once, before the future is known, and paid at its expected cost in each investment `period` its build
year and lifetime span. Operation is the expectation over the scenarios' weights, with a share priced
at the worst-outcome mean cost (CVaR) only where a risk preference is set. A plain run's data has one
scenario, one period, unit weights, no outage and every `active` flag true, so the problem is the standard
one. On a security-constrained run, PyPSA copies each branch flow limit once per `outage`, and the outage
factors, `active` flags and scenario weights come from data prep.
dimensions:
breakpoint: {dtype: int, ordered: true, description: 'the corners of a piecewise-linear curve, in order.
A curve runs over the breakpoints its data has rows for, so curves may differ in length'}
bus: {description: network nodes}
cycle: {description: 'independent cycles of the passive network graph, the cycle basis, data prep. Each
period has its own basis, of the branches that are active in it. A label is a position in that period''s
basis, so one label is a different cycle in another period'}
generator: {description: 'generating units, each on one bus'}
line: {description: 'passive branches, each between two buses, their flow set by impedance'}
link: {description: 'controllable connections, each from one bus to the buses it delivers to'}
link_output: {description: 'a link''s output ports, one label per port a link declares. The labels are
PyPSA''s `bus1`, `bus2`, … columns read long, data prep. A link of any number of output ports is
then one term in the balance'}
load: {description: 'demands, each on one bus'}
outage: {description: 'the passive branches a security-constrained run takes out one at a time (PyPSA''s
`branch_outages`), each a line or a transformer. A plain run has none'}
period: {dtype: int, ordered: true, description: investment periods. It is PyPSA's `investment_periods`}
process: {description: 'generalised multi-port converters, each with an internal power that every port
draws or delivers at its own rate'}
process_output: {description: 'a process''s ports, one label per port a process declares. The labels
are PyPSA''s `bus0`, `bus1`, …, each with a signed `rate`, data prep. A process of any number of
ports is then one term in the balance'}
scenario: {description: 'the futures dispatch is chosen in, each with a weight'}
snapshot: {dtype: datetime, ordered: true, description: dispatch periods}
transformer: {description: 'passive branches between two buses, their flow set by impedance and tap
ratio, with a phase shift fixed or optimised'}
relations:
Generator_bus: {key: generator, values: bus, description: the bus a generator sits on}
Line_bus0: {key: line, values: bus, description: the bus a line's flow is measured at}
Line_bus1: {key: line, values: bus, description: the bus at a line's other end}
Link_output_bus: {key: link_output, values: bus, description: 'the bus an output port delivers to. It
is PyPSA''s `bus1`, `bus2`, … columns. A link of three output ports is three labels here rather
than a third relation, so the file states any number of them'}
Link_output_link: {key: link_output, values: link, description: the link an output port belongs to}
Load_bus: {key: load, values: bus, description: the bus a load sits on}
Outage_line:
key: outage
values: line
missing: absent
description: the line an outage takes out. An outage of a transformer has no row
Outage_transformer:
key: outage
values: transformer
missing: absent
description: the transformer an outage takes out. An outage of a line has no row
Process_output_bus: {key: process_output, values: bus, description: 'the bus a port draws from or delivers
to. It is PyPSA''s `bus0`, `bus1`, … columns. A process of three ports is three labels here rather
than a third relation, so the file states any number of them'}
Process_output_process: {key: process_output, values: process, description: the process a port belongs
to}
snapshot_period: {key: snapshot, values: period, description: the investment period a snapshot falls
in}
parameters:
Bus_attached:
dims: [bus, snapshot]
dtype: bool
description: whether a load, a unit, a port or a branch that is active in the snapshot's period is
attached to the bus, data prep. A bus nothing is attached to has no balance row
Cycle_in_basis:
dims: [cycle, period]
dtype: bool
description: whether a period's cycle basis reaches the cycle label, data prep. A label beyond the
basis of the period has no Kirchhoff voltage law row
Generator_active:
dims: [generator, snapshot]
dtype: bool
description: whether a generator is active in a snapshot's period. It is PyPSA's `active`, from build
year and lifetime, data prep
Generator_active_asset:
dims: [generator]
dtype: bool
description: whether a generator is one of PyPSA's `active_assets`, by its `active` flag alone, without
build year and lifetime. A unit that is active in no snapshot of the horizon still counts. PyPSA
refuses one that differs by scenario (`constants.py:54`)
Generator_committable:
dims: [generator]
dtype: bool
description: whether output is gated by an on/off status decision
Generator_marginal_cost:
dims: [generator, scenario, snapshot]
description: cost of one unit of output
Generator_marginal_cost_curve_p:
dims: [breakpoint, generator]
missing: absent
description: 'the output at each breakpoint of a generator''s piecewise `marginal_cost` curve: PyPSA''s
`p_pu` breakpoints times `p_nom`, data prep. A generator with no curve has no rows'
Generator_marginal_cost_quadratic:
dims: [generator, scenario, snapshot]
description: cost of the square of one unit of output
Generator_p_max_pu:
dims: [generator, scenario, snapshot]
description: 'most output, per unit of nominal power: an availability profile'
Generator_p_min_pu:
dims: [generator, scenario, snapshot]
description: least output, per unit of nominal power
Generator_p_nom:
dims: [generator, scenario]
description: nominal power
Generator_p_nom_extendable:
dims: [generator]
dtype: bool
description: whether the nominal power is a decision
Generator_sign:
dims: [generator]
description: the sign output enters its bus's balance with. It is PyPSA's `sign`, `1` unless given,
`-1` for a unit that draws power. PyPSA refuses one that differs by scenario (`constants.py:46`)
Line_BODF:
dims: [line, outage, period]
missing: absent
description: the share of an outaged branch's flow a line takes on when that branch goes out (PyPSA's
`BODF`), data prep. It comes from the PTDF of the sub-network the period's active branches form.
A row exists only where the line and the outage are active in the period and share a sub-network.
It is -1 at the outaged line itself. PyPSA takes the factors of the first scenario (`abstract.py:652`),
and refuses impedances that differ by scenario (`constants.py:33-35`). So the factors are the same
in every scenario
Line_active:
dims: [line, snapshot]
dtype: bool
description: whether a line is active in a snapshot's period. It is PyPSA's `active`, data prep
Line_cycle_weight:
dims: [cycle, line, period]
missing: absent
description: 'the line''s series impedance, signed by its orientation in the cycle: the cycle basis,
data prep. A line in no cycle has no row. PyPSA builds the cycle basis from the first scenario (`networks.py:1430-1437`),
and refuses a `v_nom`, `x_pu_eff` or `r_pu_eff` that differs by scenario (`constants.py:33-35`).
So the weight is the same in every scenario'
Line_s_max_pu:
dims: [line, scenario, snapshot]
description: most flow either way, per unit of nominal apparent power
Line_s_nom:
dims: [line, scenario]
description: nominal apparent power
Line_s_nom_extendable:
dims: [line]
dtype: bool
description: whether the nominal apparent power is a decision
Link_active:
dims: [link, snapshot]
dtype: bool
description: whether a link is active in a snapshot's period. It is PyPSA's `active`, data prep
Link_efficiency:
dims: [link_output, scenario, snapshot]
description: 'share of the flow that arrives at an output port, PyPSA''s `efficiency`, `efficiency2`,
… read long: negative where that port consumes rather than delivers. Read at the snapshot the flow
arrives, so a delayed port delivers at its arrival snapshot''s efficiency (`constraints.py:1575`)'
Link_output_cyclic_delay:
dims: [link_output]
dtype: bool
description: whether a delayed port's flow wraps from the end of its investment period (PyPSA's `cyclic_delay`,
`cyclic_delay2`, …). Where it does not, the flow still in transit at each period's first snapshots
is lost. The flag is the same in every scenario, as the delay is
Link_output_delay:
dims: [link_output]
dtype: int
description: snapshots a port's delivery lags its link's flow (PyPSA's `delay`, `delay2`, … read long).
In data prep you divide it by the `snapshot_weightings.generators` value and round it up. It is
zero for a port that delivers at once. A port has the same delay in every scenario, because PyPSA
refuses a delay that differs by scenario (`constants.py:55`)
Load_active:
dims: [load]
dtype: bool
description: whether a load is active in the network, PyPSA's `active`. A load has no build year and
no lifetime, so the flag is the same in every snapshot. PyPSA refuses one that differs by scenario
(`constants.py:54`)
Load_p_set:
dims: [load, scenario, snapshot]
description: demand
Load_sign:
dims: [load]
description: the sign a load's demand enters its bus's balance with. It is PyPSA's `sign`, `-1` unless
given, `1` for a load that feeds its bus. PyPSA refuses one that differs by scenario (`constants.py:46`)
Process_active:
dims: [process, snapshot]
dtype: bool
description: whether a process is active in a snapshot's period. It is PyPSA's `active`, data prep
Process_output_cyclic_delay:
dims: [process_output]
dtype: bool
description: whether a delayed port's transfer wraps from the end of its investment period (PyPSA's
`cyclic_delay0`, `cyclic_delay1`, …). Where it does not, the energy still in transit at each period's
first snapshots is lost. The flag is the same in every scenario, as the delay is
Process_output_delay:
dims: [process_output]
dtype: int
description: snapshots a port's transfer lags its process's internal power (PyPSA's `delay0`, `delay1`,
… read long). In data prep you divide it by the `snapshot_weightings.generators` value and round
it up. It is zero for a port that transfers at once. A port has the same delay in every scenario,
as a link's port has
Process_rate:
dims: [process_output, scenario, snapshot]
description: the energy a port draws or delivers per unit of internal power (PyPSA's `rate0`, `rate1`,
… read long). It is negative where the port withdraws and positive where it injects. A link is a
process whose `bus0` rate is minus one and whose output rates are its efficiencies. The rate at
the snapshot the transfer arrives applies, so a delayed port transfers at its arrival snapshot's
rate (`constraints.py:1575`)
Transformer_active:
dims: [snapshot, transformer]
dtype: bool
description: whether a transformer is active in a snapshot's period. It is PyPSA's `active`, data
prep
period_weight_objective:
dims: [period]
description: PyPSA's `investment_period_weightings.objective` — what a period's cost weighs. PyPSA
reads it only under `multi_investment_periods`. Otherwise you feed one in data prep, whatever the
column contains (`optimize.py:231-233`, `:293-297`)
scenario_weight:
dims: [scenario]
description: PyPSA's `scenario_weightings.weight` — the probability of a future
snapshot_weightings_objective:
dims: [snapshot]
description: PyPSA's `snapshot_weightings.objective` — hours a snapshot weighs in the cost
variables:
Generator_p:
dims: [generator, scenario, snapshot]
where: Generator_active
description: '`Generator-p` — output of a generator in a snapshot'
Line_s:
dims: [line, scenario, snapshot]
where: Line_active
description: '`Line-s` — PyPSA''s `p0`, the flow measured at the `Line_bus0` end: a positive value
withdraws there and injects at `Line_bus1`, lossless'
Transformer_s:
dims: [scenario, snapshot, transformer]
where: Transformer_active
description: '`Transformer-s` — PyPSA''s `p0`, the flow measured at the `Transformer_bus0` end: a
positive value withdraws there and injects at `Transformer_bus1`, lossless'
Link_p:
dims: [link, scenario, snapshot]
where: Link_active
description: '`Link-p` — PyPSA''s `p0`, the flow measured at the `Link_bus0` end. A positive value
withdraws there and injects at every bus the link''s output ports deliver to'
Process_p:
dims: [process, scenario, snapshot]
where: Process_active
description: '`Process-p` — PyPSA''s internal power `p`. A positive value drives every port at its
own rate, withdrawing where the rate is negative and injecting where it is positive'
Generator_marginal_cost_piecewise:
dims: [generator, scenario, snapshot]
where: Generator_marginal_cost_curve AND Generator_active
description: '`Generator-marginal_cost_piecewise` — the running cost of a generator that pays along
a curve, held above the curve'
constraints:
Bus_nodal_balance:
dims: [bus, scenario, snapshot]
where: Bus_attached
expression: Bus_injection == 0
description: '`Bus-nodal_balance` — what is generated at a bus meets the load there, less half of
every incident line''s and transformer''s loss. What is generated includes storage dispatch and
stores. It is net of what the links take away, plus what arrives over them after losses and any
delay at every port they deliver to. Each process port draws or delivers at its own rate, and each
passive branch carries its flow. PyPSA dissipates a branch''s loss half at either end. Each generator,
storage unit, store and load term enters with its component''s `sign` (`constraints.py:1480-1481`,
`:1592`), and an inactive load not at all. A bus nothing is attached to has no row. PyPSA refuses
one that carries load. The file states no assumption for it.'
Generator_fix_p_lower:
dims: [generator, scenario, snapshot]
where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
expression: Generator_p >= Generator_p_min_pu * Generator_p_nom
description: '`Generator-fix-p-lower` — a fixed generator outputs at least its minimum'
Generator_fix_p_upper:
dims: [generator, scenario, snapshot]
where: not Generator_p_nom_extendable AND not Generator_committable AND Generator_active
expression: Generator_p <= Generator_p_max_pu * Generator_p_nom
description: '`Generator-fix-p-upper` — a fixed generator outputs at most what is available'
Kirchhoff_Voltage_Law:
dims: [cycle, scenario, snapshot]
where: at(Cycle_in_basis, by=snapshot_period[period])
expression: Cycle_angle_sum == 0
description: '`Kirchhoff-Voltage-Law` — around every independent cycle the impedance-weighted flows
sum to nothing. This makes the linear power flow physical rather than transport. A transformer''s
flow weighs its effective reactance, and its phase shift enters the cycle sum too. The shift is
a constant where it is fixed. Where a phase-shifting transformer chooses its shift, it is the shift
decision times its cycle weight. A snapshot uses the cycles of its own period, of the branches that
are active in it (`constraints.py:1710-1729`). A cycle label that period''s basis does not reach
has no row'
Line_fix_s_lower:
dims: [line, scenario, snapshot]
where: not Line_s_nom_extendable AND Line_active
expression: Line_s >= (-Line_s_max_pu) * Line_s_nom
description: '`Line-fix-s-lower` — a fixed line carries at least the negative of its rating, the loss
counted against it'
Line_fix_s_lower_security:
dims: [line, outage, scenario, snapshot]
where: not Line_s_nom_extendable AND at(Line_BODF, by=snapshot_period[period]) AND Line_active
expression: Line_s_monitored + at(Line_BODF, by=snapshot_period[period]) * Outage_s >= -Line_s_max_pu
* Line_s_nom
description: '`Line-fix-s-lower-security-for-{c}-outage-in-sub-network-{n}` — after any one outage,
a fixed line carries at least the negative of its rating. Its flow takes on its share of the outaged
branch''s flow. PyPSA names one row per outaged component `c` and sub-network `n`. Under `multi_investment_periods`
it appends `-period-{p}` for each period `p`. This entry states them all over the outage dimension.
A line inactive in the snapshot''s period has no row'
Line_fix_s_upper:
dims: [line, scenario, snapshot]
where: not Line_s_nom_extendable AND Line_active
expression: Line_s <= Line_s_max_pu * Line_s_nom
description: '`Line-fix-s-upper` — a fixed line carries at most its rating, the loss included'
Line_fix_s_upper_security:
dims: [line, outage, scenario, snapshot]
where: not Line_s_nom_extendable AND at(Line_BODF, by=snapshot_period[period]) AND Line_active
expression: Line_s_monitored + at(Line_BODF, by=snapshot_period[period]) * Outage_s <= Line_s_max_pu
* Line_s_nom
description: '`Line-fix-s-upper-security-for-{c}-outage-in-sub-network-{n}` — after any one outage,
a fixed line carries at most its rating. Its flow takes on its share of the outaged branch''s flow.
PyPSA names one row per outaged component `c` and sub-network `n`. Under `multi_investment_periods`
it appends `-period-{p}` for each period `p`. This entry states them all over the outage dimension.
A line inactive in the snapshot''s period has no row'
expressions:
Bus_injection:
dims: [bus, scenario, snapshot]
expression: (((Generator_injection + Line_injection) + Link_injection) + Load_injection) + Process_injection
description: what every component puts into a bus, less what it takes out of it. PyPSA writes each
term into the balance, and a load on its right-hand side
Cycle_angle_sum:
dims: [cycle, scenario, snapshot]
expression: Line_angle_sum
description: 'the voltage angle differences around a cycle: every branch flow times its cycle weight,
and every transformer phase shift'
Generator_injection: {expression: 'sum(Generator_sign * Generator_p, over=generator, by=Generator_bus[bus])'}
Generator_opex: {expression: 'sum(sum((Generator_running_cost * snapshot_weightings_objective) * at(period_weight_objective,
by=snapshot_period[period]), over=generator), over=snapshot) + sum(sum((((Generator_p * Generator_p)
* Generator_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
by=snapshot_period[period]), over=generator), over=snapshot)'}
Generator_running_cost:
dims: [generator, scenario, snapshot]
description: 'what a generator''s output costs in a snapshot: the value read off its piecewise curve
where it has one, and its linear `marginal_cost` otherwise. A curve replaces the linear cost, as
PyPSA drops the unit from that term (`optimize.py:333-348`)'
cases:
curve: {when: Generator_marginal_cost_curve, expression: Generator_marginal_cost_piecewise}
otherwise: Generator_p * Generator_marginal_cost
Line_angle_sum: {expression: 'sum(Line_s * at(Line_cycle_weight, by=snapshot_period[period]), over=line)'}
Line_injection: {expression: '(-sum(Line_s, over=line, by=Line_bus0[bus])) + sum(Line_s, over=line,
by=Line_bus1[bus])'}
Line_s_monitored:
dims: [line, scenario, snapshot]
description: the flow in a line's post-contingency rows. It is its flow where it is active, and nothing
where it does not. PyPSA builds those rows for every branch of the sub-network in every snapshot
cases:
standing: {when: Line_active, expression: Line_s}
otherwise: '0'
Link_injection: {expression: 'sum(Link_output_arrival, over=link_output, by=Link_output_bus[bus])'}
Link_output_arrival:
dims: [link_output, scenario, snapshot]
description: what a link delivers to an output port at a snapshot. It is its flow delayed by the port's
`delay` within its investment period. It is multiplied by the port's efficiency at the snapshot
the flow arrives. Where the port is `cyclic_delay`, the delayed flow wraps from the period's end.
Where it is not, the flow still in transit at the period's first snapshots is lost. A port that
does not delay (`delay` zero) delivers its flow unshifted, cyclic or not
cases:
wrapping: {when: Link_output_cyclic_delay, expression: 'shift(at(Link_p, by=Link_output_link[link]),
along=snapshot, offset=Link_output_delay, edge=''wrap'', within=snapshot_period[period]) * Link_efficiency'}
otherwise: shift(at(Link_p, by=Link_output_link[link]), along=snapshot, offset=Link_output_delay,
edge=0, within=snapshot_period[period]) * Link_efficiency
Load_demand:
dims: [load, scenario, snapshot]
description: what a load draws from its bus's balance. It is its demand times its sign where it is
active, and nothing where it is not. PyPSA drops an inactive load from the balance (`constraints.py:1591-1592`)
cases:
active: {when: Load_active, expression: Load_sign * Load_p_set}
otherwise: '0'
Load_injection: {expression: 'sum(Load_demand, over=load, by=Load_bus[bus])'}
Outage_s:
dims: [outage, scenario, snapshot]
description: 'the flow an outage takes off its branch: the outaged line''s or transformer''s flow
before it goes out'
cases:
line: {when: Outage_line, expression: 'at(Line_s_monitored, by=Outage_line[line])'}
otherwise: at(Transformer_s_monitored, by=Outage_transformer[transformer])
Process_injection: {expression: 'sum(Process_output_arrival, over=process_output, by=Process_output_bus[bus])'}
Process_output_arrival:
dims: [process_output, scenario, snapshot]
description: what a process transfers at a port at a snapshot. It is its internal power delayed by
the port's `delay` within its investment period. It is multiplied by the port's rate at the snapshot
the transfer arrives. Where the port is `cyclic_delay`, the delayed transfer wraps from the period's
end. Where it is not, the energy still in transit at the period's first snapshots is lost. A port
that does not delay (`delay` zero) transfers at once, cyclic or not
cases:
wrapping: {when: Process_output_cyclic_delay, expression: 'shift(at(Process_p, by=Process_output_process[process]),
along=snapshot, offset=Process_output_delay, edge=''wrap'', within=snapshot_period[period])
* Process_rate'}
otherwise: shift(at(Process_p, by=Process_output_process[process]), along=snapshot, offset=Process_output_delay,
edge=0, within=snapshot_period[period]) * Process_rate
Transformer_s_monitored:
dims: [scenario, snapshot, transformer]
description: the flow a transformer's post-contingency rows read, as a line's
cases:
standing: {when: Transformer_active, expression: Transformer_s}
otherwise: '0'
risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
scenario_opex:
dims: [scenario]
expression: Generator_opex
description: 'what a future costs to run: every operating term, weighted by the snapshot''s hours
and its period, before the scenario''s own weight. A start and a stop cost what they cost, unweighted,
as PyPSA adds them (`optimize.py:448-468`)'
total_cost:
dims: []
expression: risk_weighted_opex
description: what the system costs. Capacity counts once per active period at its expected cost over
the scenarios. Operation counts in expectation over the scenarios, and a share of it at the tail
conditions:
Generator_marginal_cost_curve: {condition: 'count(Generator_marginal_cost_curve_p, over=breakpoint)
> 0 AND Generator_active_asset', description: 'a generator that pays along a piecewise `marginal_cost`
curve: one of PyPSA''s `active_assets` with curve data (`optimize.py:307`, `piecewise.py:230-257`)'}
objective: {sense: minimize, expression: total_cost}
The prep — every table the spec declares, from the network — and the solve:
from differential.pypsa.prep import relation, static, varying, weighting
n = build() # the network from the PyPSA tab
sources = {
'bus': pl.Series('bus', list(names(n.buses.index).astype(str)), dtype=pl.String),
**{
dim: pl.Series(dim, list(names(n.static(component).index).astype(str)), dtype=pl.String)
for component, dim in DIM.items()
},
**scenarios(n),
**periods(n, multi),
**carriers(n, multi),
'snapshot': pl.Series('snapshot', list(timesteps(n)), dtype=pl.Datetime('us')),
'Generator_bus': relation(n, 'Generator', 'bus'),
'Load_bus': relation(n, 'Load', 'bus'),
'Bus_attached': attached(n),
'Generator_sign': per_component('Generator', first_scenario(n.generators['sign'])),
'Load_active': per_component('Load', first_scenario(loads['active']), bool),
'Load_p_set': varying(n, 'Load', 'p_set'),
'Load_sign': per_component('Load', first_scenario(loads['sign'])),
'snapshot_weightings_objective': weighting(n, 'objective'),
}
with sps.solve('differential/pypsa/rungs/rung_66_cycles_per_period.yaml', sources) as solution:
solution.objective # 16000.0
The network, rung_66_cycles_per_period.py in the corpus — the spine plus what this rung adds:
# SPDX-FileCopyrightText: mathspec Contributors
#
# SPDX-License-Identifier: MIT
"""Rung 66: cycles per period — a line that comes in with the second period closes a triangle, under a security-constrained run that outages it."""
from __future__ import annotations
from datetime import datetime
import pandas as pd
OPTIMIZE = {'multi_investment_periods': True}
BRANCH_OUTAGES = ['ca66']
def build():
"""A whole network, not the spine: a path from `a` to `c` in 2020, and a triangle in 2030 once `ca66` stands."""
import pypsa
n = pypsa.Network()
n.snapshots = pd.MultiIndex.from_tuples(
[(2020, datetime(2020, 1, 1, t)) for t in range(2)] + [(2030, datetime(2030, 1, 1, t)) for t in range(2)]
)
n.investment_periods = [2020, 2030]
n.investment_period_weightings['objective'] = [1.0, 0.5]
n.investment_period_weightings['years'] = [10.0, 10.0]
n.snapshot_weightings['objective'] = [2.0, 1.5, 2.5, 3.0]
n.add('Bus', ['a', 'b', 'c'])
n.add('Generator', 'hydro66', bus='a', p_nom=300, marginal_cost=10)
n.add('Generator', 'diesel66', bus='c', p_nom=300, marginal_cost=100)
n.add('Load', 'town66', bus='c', p_set=[80, 100, 90, 110])
n.add('Line', 'ab66', bus0='a', bus1='b', x=0.1, s_nom=150)
n.add('Line', 'bc66', bus0='b', bus1='c', x=0.1, s_nom=150)
n.add('Line', 'ca66', bus0='c', bus1='a', x=0.1, s_nom=40, build_year=2030, lifetime=50)
return n
The data¶
Every table this spec declares was first declared by a lower rung; its values here are in the prep above.