Rung 76: stores that cover a storage unit — a power rating through max_hours, an efficiency each way, inflow and spill, and a cost each way¶
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 11362.944444 on both sides; structure ✔ 20 constraints · 7 variables, name for name; size ✔ 139 rows · ✔ 66 columns · ✔ 246 nonzeros; duals ✔ 139 rows, 5 inside PyPSA's range; model for model: 27 blocks equal, 0 documented splits, 1 recorded deviations.
Rows and columns, PyPSA against specsolve, name for name
| row | PyPSA | specsolve |
|---|---|---|
Bus-nodal_balance |
8 | 8 |
Generator-fix-p-lower |
8 | 8 |
Generator-fix-p-upper |
8 | 8 |
Link-fix-p-lower |
4 | 4 |
Link-fix-p-upper |
4 | 4 |
Store-energy_balance |
16 | 16 |
Store-ext-e-lower |
8 | 8 |
Store-ext-e-upper |
8 | 8 |
Store-ext-e_nom-lower |
2 | 2 |
Store-ext-e_nom-upper |
1 | 1 |
Store-ext-p-lower |
4 | 4 |
Store-ext-p-upper |
4 | 4 |
Store-ext-p_store-lower |
8 | 8 |
Store-ext-p_store-upper |
8 | 8 |
Store-fix-e-lower |
8 | 8 |
Store-fix-e-upper |
8 | 8 |
Store-fix-p-lower |
8 | 8 |
Store-fix-p-upper |
8 | 8 |
Store-fix-p_store-lower |
8 | 8 |
Store-fix-p_store-upper |
8 | 8 |
| column | PyPSA | specsolve |
|---|---|---|
Generator-p |
8 | 8 |
Link-p |
4 | 4 |
Store-e |
16 | 16 |
Store-e_nom |
2 | 2 |
Store-p |
16 | 16 |
Store-p_store |
16 | 16 |
Store-spill |
4 | 4 |
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{Link\_bus0}: \mathcal{L} \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},\ \mathrm{Store\_bus}: \mathcal{V} \to \mathcal{N}\) — network nodes |
| \(\mathcal{G}\) | index \(g\) — generator with \(\mathrm{Generator\_bus}: \mathcal{G} \to \mathcal{N}\) — generating units, each on one bus |
| \(\mathcal{L}\) | index \(l\) — link with \(\mathrm{Link\_bus0}: \mathcal{L} \to \mathcal{N},\ \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{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{V}\) | index \(v\) — store with \(\mathrm{Store\_bus}: \mathcal{V} \to \mathcal{N}\) — pure energy stores, each on one bus |
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{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) |
| \(\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 |
| \(\mathrm{com}^{f}\) | Link_committable over \(\mathcal{L}\) — whether flow is gated by an on/off status decision |
| \(\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{c}^{f}\) | Link_marginal_cost over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of one unit of flow |
| \(\mathrm{c}^{f,(2)}\) | Link_marginal_cost_quadratic over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — cost of the square of one unit of flow |
| \(\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) |
| \(\overline{\mathrm{f}}\) | Link_p_max_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — most flow, per unit of nominal power |
| \(\underline{\mathrm{f}}\) | Link_p_min_pu over \(\mathcal{L} \times \Xi \times \mathcal{T}\) — least flow, per unit of nominal power: negative for a link that carries both ways |
| \(\mathrm{f}^{\mathrm{nom}}\) | Link_p_nom over \(\mathcal{L} \times \Xi\) — nominal power |
| \(\mathrm{ext}^{f}\) | Link_p_nom_extendable over \(\mathcal{L}\) — whether the nominal power is a decision |
| \(\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}^{e}\) | Store_active over \(\mathcal{T} \times \mathcal{V}\) — whether a store is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\mathrm{act}^{e}\) | Store_active_asset over \(\mathcal{V}\) — whether a store 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{c}^{\mathrm{cap},e}\) | Store_capital_cost over \(\Xi \times \mathcal{V}\) — cost of one unit of nominal capacity for the modelled horizon (PyPSA's periodized_cost), data prep. It is overnight_cost as an annuity over lifetime at discount_rate, times nyears, where overnight_cost is given, and capital_cost where it is not. Both add fom_cost (components.py:1157-1178, costs.py:102-203) |
| \(\mathrm{W}^{e}\) | Store_capital_weight over \(\mathcal{V}\) — the sum of period weights a store is active in. It is PyPSA's active * period_weighting, summed, data prep |
| \(\mathrm{cyc}^{e}\) | Store_e_cyclic over \(\Xi \times \mathcal{V}\) — whether the horizon closes on itself instead of opening on the initial energy |
| \(\mathrm{cyc}^{e,y}\) | Store_e_cyclic_per_period over \(\Xi \times \mathcal{V}\) — whether each investment period closes on itself instead of carrying its energy on to the next. It overrides e_cyclic and e_initial_per_period. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep |
| \(\mathrm{e}^{0}\) | Store_e_initial over \(\Xi \times \mathcal{V}\) — energy held before the first snapshot |
| \(\mathrm{reset}^{e}\) | Store_e_initial_per_period over \(\Xi \times \mathcal{V}\) — whether each investment period opens on the initial energy instead of carrying the previous period's. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep |
| \(\overline{\mathrm{e}}\) | Store_e_max_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — most energy held, per unit of nominal capacity |
| \(\underline{\mathrm{e}}\) | Store_e_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — least energy held, per unit of nominal capacity: negative for a store that may go short |
| \(\mathrm{e}^{\mathrm{nom}}\) | Store_e_nom over \(\Xi \times \mathcal{V}\) — nominal energy capacity |
| \(\mathrm{ext}^{e}\) | Store_e_nom_extendable over \(\mathcal{V}\) — whether the nominal energy capacity is a decision |
| \(\overline{\mathrm{e}}^{\mathrm{nom}}\) | Store_e_nom_max over \(\Xi \times \mathcal{V}\) — most nominal capacity an extendable store may be built at |
| \(\underline{\mathrm{e}}^{\mathrm{nom}}\) | Store_e_nom_min over \(\Xi \times \mathcal{V}\) — least nominal capacity an extendable store may be built at |
| \(\eta^{e,+}\) | Store_efficiency_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of the energy drawn down that reaches the bus |
| \(\eta^{e,-}\) | Store_efficiency_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of the power drawn from the bus that becomes energy held |
| \(\mathrm{idle}^{e}\) | Store_inactive_snapshots over \(\mathcal{V}\) — how many snapshots a store is not active in. It is PyPSA's (~active).sum(), data prep. A cyclic store reaches back this many snapshots further, so it closes on the last snapshot it is active in |
| \(\mathrm{inflow}^{e}\) | Store_inflow over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — energy arriving per hour, a river into a reservoir |
| \(\mathrm{c}^{q}\) | Store_marginal_cost over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of power delivered |
| \(\mathrm{c}^{q,+}\) | Store_marginal_cost_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of discharge, p + p_store |
| \(\mathrm{c}^{q,(2)}\) | Store_marginal_cost_quadratic over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of the square of the net power delivered, so charging costs as much as delivering |
| \(\mathrm{c}^{e}\) | Store_marginal_cost_storage over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of energy held over one snapshot |
| \(\mathrm{c}^{q,-}\) | Store_marginal_cost_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of charging, p_store |
| \(\mathrm{T}^{e}\) | Store_max_hours over \(\Xi \times \mathcal{V}\), absent where the data has no row — energy capacity, as hours of discharge at the power rating. The rating is e_nom / max_hours. No value means PyPSA's default of infinity, and the store's power is then unbounded |
| \(\mathrm{open}^{e}\) | Store_opens_late over \(\mathcal{T} \times \mathcal{V}\) — whether a snapshot is the first a store is active in, where that is not the first of the horizon, data prep. It is PyPSA's active.cumsum() == 1 over the snapshots it is active in, past the first snapshot. It is false in a run where every store is active throughout |
| \(\overline{\mathrm{q}}\) | Store_p_max_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — most discharge, per unit of the power rating. It is PyPSA's p_max_pu, 1 unless given, read only where max_hours has a value |
| \(\underline{\mathrm{q}}\) | Store_p_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — most charging, per unit of the power rating, negated. It is PyPSA's p_min_pu, -1 unless given, read only where max_hours has a value |
| \(\rho^{e}\) | Store_retention over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — share of energy kept over a snapshot. It is PyPSA's (1 - standing_loss) ** elapsed hours, data prep |
| \(\mathrm{sgn}^{q}\) | Store_sign over \(\mathcal{V}\) — the sign the power a store delivers enters its bus's balance with. It is PyPSA's sign, 1 unless given. PyPSA refuses one that differs by scenario (constants.py:46) |
| \(\mathrm{c}^{\mathrm{spill},e}\) | Store_spill_cost over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — cost of one unit of inflow passed on unused |
| \(\mathrm{split}^{e}\) | Store_split_dispatch over \(\Xi \times \mathcal{V}\) — whether a store charges through p_store apart from its net dispatch p. It is PyPSA's split_dispatch(): true where an efficiency differs from one, a cost applies to one direction only, or cycles_max is finite, in any snapshot (stores.py:88-116), data prep. Where it is false, p_store is held at zero and the charging bound applies to p |
| \(\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 |
| \(\mathrm{w}^{\mathrm{sto}}\) | snapshot_weightings_stores over \(\mathcal{T}\) — PyPSA's snapshot_weightings.stores — hours a snapshot weighs in a storage balance |
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 |
| \(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 |
| \(e\) | Store_e over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-e — energy held at the end of a snapshot |
| \(E\) | Store_e_nom_ext over \(\mathcal{V}\) — Store-e_nom — nominal capacity where it is a decision, for a store that is active. A fixed build is the parameter of the same PyPSA name |
| \(q\) | Store_p over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-p — net power delivered to the bus. Charging is negative |
| \(q^{-}\) | Store_p_store over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-p_store — power drawn from the bus to charge, so that p + p_store is the discharge. It is held at zero by its rows where the store does not split its dispatch |
| \(\mathit{spill}^{e}\) | Store_spill over \(\Xi \times \mathcal{T} \times \mathcal{V}\), \(0\) where the mask leaves it out — Store-spill — inflow passed on unused. It is zero where there is no inflow, so the balance keeps its row there. The bounds are PyPSA's, on the variable rather than as rows |
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{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{Link\_injection}\) | Link_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Link\_opex}\) | Link_opex over \(\Xi\) |
| \(\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{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{Store\_capex}\) | Store_capex (scalar) |
| \(\mathrm{Store\_charge\_cap\_pu}\) | Store_charge_cap_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — the most charging through p_store, per unit of e_nom. It is -p_min_pu / max_hours for a store that splits its dispatch, and zero otherwise (stores.py:79-86) |
| \(\mathrm{Store\_discharge\_floor\_pu}\) | Store_discharge_floor_pu over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — the least discharge, per unit of e_nom. It is zero for a store that splits its dispatch, so p_store carries the charge. Otherwise it is the most charging as a negative discharge, p_min_pu / max_hours (stores.py:79-86) |
| \(\mathit{Store\_energy\_carried\_in}\) | Store_energy_carried_in over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — the energy a store opens a snapshot with. At the first snapshot it is active in, it is its last such snapshot's less standing loss where it is cyclic. Where it is not, it is the given initial energy, which no standing loss has touched yet. Otherwise it is the previous snapshot's less standing loss. A store built in a later period opens in that period, and a cyclic one that retires closes on its own last snapshot. Per period, the same holds with each investment period as the horizon |
| \(\mathit{Store\_injection}\) | Store_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{Store\_opex}\) | Store_opex over \(\Xi\) |
| \(\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\) |
| \(\mathrm{pos}(t)\) | position() — the position of \(t\), counted from \(0\); \(t\) is the label |
| \(\mathrm{pos}_{\mathrm{relation}(t)}(t)\) | position(within=relation[...]) — the position of \(t\) inside its group |
Conditions¶
Generator_marginal_cost_curve
Variable domains¶
Generator_marginal_cost_piecewise
Generator_p
Link_p
Process_p
Store_e
Store_e_nom_ext
Store_p
Store_p_store
Store_spill
Definitions¶
Bus_injection
Generator_injection
Generator_opex
Generator_running_cost
Link_injection
Link_opex
Link_output_arrival
Load_demand
Load_injection
Process_injection
Process_output_arrival
Store_capex
Store_charge_cap_pu
Store_discharge_floor_pu
Store_energy_carried_in
Store_injection
Store_opex
risk_weighted_opex
scenario_opex
total_cost
Objective¶
Subject to¶
Bus_nodal_balance
Generator_fix_p_lower
Generator_fix_p_upper
Link_fix_p_lower
Link_fix_p_upper
Store_energy_balance
Store_ext_e_lower
Store_ext_e_nom_lower
Store_ext_e_nom_upper
Store_ext_e_upper
Store_ext_p_lower
Store_ext_p_store_lower
Store_ext_p_store_upper
Store_ext_p_upper
Store_fix_e_lower
Store_fix_e_upper
Store_fix_p_lower
Store_fix_p_store_lower
Store_fix_p_store_upper
Store_fix_p_upper
The spec, differential/pypsa/rungs/rung_76_store_power.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}
generator: {description: 'generating units, each on one bus'}
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'}
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}
store: {description: 'pure energy stores, each on one bus'}
relations:
Generator_bus: {key: generator, values: bus, description: the bus a generator sits on}
Link_bus0: {key: link, values: bus, description: the bus a link leaves}
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}
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}
Store_bus: {key: store, values: bus, description: the bus a store sits on}
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
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`)
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_committable:
dims: [link]
dtype: bool
description: whether flow is gated by an on/off status decision
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_marginal_cost:
dims: [link, scenario, snapshot]
description: cost of one unit of flow
Link_marginal_cost_quadratic:
dims: [link, scenario, snapshot]
description: cost of the square of one unit of flow
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`)
Link_p_max_pu:
dims: [link, scenario, snapshot]
description: most flow, per unit of nominal power
Link_p_min_pu:
dims: [link, scenario, snapshot]
description: 'least flow, per unit of nominal power: negative for a link that carries both ways'
Link_p_nom:
dims: [link, scenario]
description: nominal power
Link_p_nom_extendable:
dims: [link]
dtype: bool
description: whether the nominal power is a decision
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`)
Store_active:
dims: [snapshot, store]
dtype: bool
description: whether a store is active in a snapshot's period. It is PyPSA's `active`, data prep
Store_active_asset:
dims: [store]
dtype: bool
description: whether a store 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`)
Store_capital_cost:
dims: [scenario, store]
description: cost of one unit of nominal capacity for the modelled horizon (PyPSA's `periodized_cost`),
data prep. It is `overnight_cost` as an annuity over `lifetime` at `discount_rate`, times `nyears`,
where `overnight_cost` is given, and `capital_cost` where it is not. Both add `fom_cost` (`components.py:1157-1178`,
`costs.py:102-203`)
Store_capital_weight:
dims: [store]
description: the sum of period weights a store is active in. It is PyPSA's `active * period_weighting`,
summed, data prep
Store_e_cyclic:
dims: [scenario, store]
dtype: bool
description: whether the horizon closes on itself instead of opening on the initial energy
Store_e_cyclic_per_period:
dims: [scenario, store]
dtype: bool
description: whether each investment period closes on itself instead of carrying its energy on to
the next. It overrides `e_cyclic` and `e_initial_per_period`. PyPSA reads it only under `multi_investment_periods`.
Otherwise you feed false in data prep
Store_e_initial:
dims: [scenario, store]
description: energy held before the first snapshot
Store_e_initial_per_period:
dims: [scenario, store]
dtype: bool
description: whether each investment period opens on the initial energy instead of carrying the previous
period's. PyPSA reads it only under `multi_investment_periods`. Otherwise you feed false in data
prep
Store_e_max_pu:
dims: [scenario, snapshot, store]
description: most energy held, per unit of nominal capacity
Store_e_min_pu:
dims: [scenario, snapshot, store]
description: 'least energy held, per unit of nominal capacity: negative for a store that may go short'
Store_e_nom:
dims: [scenario, store]
description: nominal energy capacity
Store_e_nom_extendable:
dims: [store]
dtype: bool
description: whether the nominal energy capacity is a decision
Store_e_nom_max:
dims: [scenario, store]
description: most nominal capacity an extendable store may be built at
Store_e_nom_min:
dims: [scenario, store]
description: least nominal capacity an extendable store may be built at
Store_efficiency_dispatch:
dims: [scenario, snapshot, store]
description: share of the energy drawn down that reaches the bus
Store_efficiency_store:
dims: [scenario, snapshot, store]
description: share of the power drawn from the bus that becomes energy held
Store_inactive_snapshots:
dims: [store]
dtype: int
description: how many snapshots a store is not active in. It is PyPSA's `(~active).sum()`, data prep.
A cyclic store reaches back this many snapshots further, so it closes on the last snapshot it is
active in
Store_inflow:
dims: [scenario, snapshot, store]
description: energy arriving per hour, a river into a reservoir
Store_marginal_cost:
dims: [scenario, snapshot, store]
description: cost of one unit of power delivered
Store_marginal_cost_dispatch:
dims: [scenario, snapshot, store]
description: cost of one unit of discharge, `p + p_store`
Store_marginal_cost_quadratic:
dims: [scenario, snapshot, store]
description: cost of the square of the net power delivered, so charging costs as much as delivering
Store_marginal_cost_storage:
dims: [scenario, snapshot, store]
description: cost of one unit of energy held over one snapshot
Store_marginal_cost_store:
dims: [scenario, snapshot, store]
description: cost of one unit of charging, `p_store`
Store_max_hours:
dims: [scenario, store]
missing: absent
description: energy capacity, as hours of discharge at the power rating. The rating is `e_nom / max_hours`.
No value means PyPSA's default of infinity, and the store's power is then unbounded
Store_opens_late:
dims: [snapshot, store]
dtype: bool
description: whether a snapshot is the first a store is active in, where that is not the first of
the horizon, data prep. It is PyPSA's `active.cumsum() == 1` over the snapshots it is active in,
past the first snapshot. It is false in a run where every store is active throughout
Store_p_max_pu:
dims: [scenario, snapshot, store]
description: most discharge, per unit of the power rating. It is PyPSA's `p_max_pu`, `1` unless given,
read only where `max_hours` has a value
Store_p_min_pu:
dims: [scenario, snapshot, store]
description: most charging, per unit of the power rating, negated. It is PyPSA's `p_min_pu`, `-1`
unless given, read only where `max_hours` has a value
Store_retention:
dims: [scenario, snapshot, store]
description: share of energy kept over a snapshot. It is PyPSA's `(1 - standing_loss) ** elapsed hours`,
data prep
Store_sign:
dims: [store]
description: the sign the power a store delivers enters its bus's balance with. It is PyPSA's `sign`,
`1` unless given. PyPSA refuses one that differs by scenario (`constants.py:46`)
Store_spill_cost:
dims: [scenario, snapshot, store]
description: cost of one unit of inflow passed on unused
Store_split_dispatch:
dims: [scenario, store]
dtype: bool
description: 'whether a store charges through `p_store` apart from its net dispatch `p`. It is PyPSA''s
`split_dispatch()`: true where an efficiency differs from one, a cost applies to one direction only,
or `cycles_max` is finite, in any snapshot (`stores.py:88-116`), data prep. Where it is false, `p_store`
is held at zero and the charging bound applies to `p`'
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
snapshot_weightings_stores:
dims: [snapshot]
description: PyPSA's `snapshot_weightings.stores` — hours a snapshot weighs in a storage balance
variables:
Generator_p:
dims: [generator, scenario, snapshot]
where: Generator_active
description: '`Generator-p` — output of a generator in a snapshot'
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'
Store_e:
dims: [scenario, snapshot, store]
where: Store_active
description: '`Store-e` — energy held at the end of a snapshot'
Store_e_nom_ext:
dims: [store]
where: Store_e_nom_extendable AND Store_active_asset
description: '`Store-e_nom` — nominal capacity where it is a decision, for a store that is active.
A fixed build is the parameter of the same PyPSA name'
Store_p:
dims: [scenario, snapshot, store]
where: Store_active
description: '`Store-p` — net power delivered to the bus. Charging is negative'
Store_p_store:
dims: [scenario, snapshot, store]
where: Store_active
description: '`Store-p_store` — power drawn from the bus to charge, so that `p + p_store` is the discharge.
It is held at zero by its rows where the store does not split its dispatch'
Store_spill:
dims: [scenario, snapshot, store]
where: Store_inflow > 0 AND Store_active
bounds: {lower: 0.0, upper: Store_inflow}
missing: 0.0
description: '`Store-spill` — inflow passed on unused. It is zero where there is no inflow, so the
balance keeps its row there. The bounds are PyPSA''s, on the variable rather than as rows'
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'
Link_fix_p_lower:
dims: [link, scenario, snapshot]
where: not Link_p_nom_extendable AND not Link_committable AND Link_active
expression: Link_p >= Link_p_min_pu * Link_p_nom
description: '`Link-fix-p-lower` — a fixed link carries at least its minimum, negative for the other
way'
Link_fix_p_upper:
dims: [link, scenario, snapshot]
where: not Link_p_nom_extendable AND not Link_committable AND Link_active
expression: Link_p <= Link_p_max_pu * Link_p_nom
description: '`Link-fix-p-upper` — a fixed link carries at most its nominal power'
Store_energy_balance:
dims: [scenario, snapshot, store]
where: Store_active
expression: Store_energy_carried_in - Store_p * snapshot_weightings_stores / Store_efficiency_dispatch
+ (Store_efficiency_store - 1 / Store_efficiency_dispatch) * Store_p_store * snapshot_weightings_stores
+ (Store_inflow - Store_spill) * snapshot_weightings_stores == Store_e
description: '`Store-energy_balance` — the energy carried in, less the discharge drawn down before
its efficiency, plus the charge after its own, plus inflow not spilled. The net dispatch `p` is
the discharge less `p_store`, so `p_store` enters with both efficiencies (`constraints.py:2472-2476`)'
Store_ext_e_lower:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active
expression: Store_e >= Store_e_min_pu * Store_e_nom_ext
description: '`Store-ext-e-lower` — an extendable store holds at least its floor of the chosen build'
Store_ext_e_nom_lower:
dims: [scenario, store]
where: Store_e_nom_extendable AND Store_active_asset
expression: Store_e_nom_ext >= Store_e_nom_min
description: '`Store-ext-e_nom-lower` — the chosen build is at least its floor in every scenario'
Store_ext_e_nom_upper:
dims: [scenario, store]
where: Store_e_nom_extendable AND Store_active_asset AND Store_e_nom_max
expression: Store_e_nom_ext <= Store_e_nom_max
description: '`Store-ext-e_nom-upper` — the chosen build is at most its cap in every scenario. A cap
of infinity is no row'
Store_ext_e_upper:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active
expression: Store_e <= Store_e_max_pu * Store_e_nom_ext
description: '`Store-ext-e-upper` — an extendable store holds at most the chosen build'
Store_ext_p_lower:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active AND (Store_split_dispatch OR Store_max_hours)
expression: Store_p + Store_p_store >= Store_discharge_floor_pu * Store_e_nom_ext
description: '`Store-ext-p-lower` — an extendable store discharges at least its floor, which is zero
where it splits its dispatch and its most charging otherwise. A store that does not split and has
no `max_hours` has no row'
Store_ext_p_store_lower:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active
expression: Store_p_store >= 0
description: '`Store-ext-p_store-lower` — charging is non-negative'
Store_ext_p_store_upper:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active AND (NOT Store_split_dispatch OR Store_max_hours)
expression: Store_p_store <= Store_charge_cap_pu * Store_e_nom_ext
description: '`Store-ext-p_store-upper` — an extendable store charges at most the power rating of
the chosen build where it splits its dispatch, and not at all where it does not. A store that splits
and has no `max_hours` has no row'
Store_ext_p_upper:
dims: [scenario, snapshot, store]
where: Store_e_nom_extendable AND Store_active AND Store_max_hours
expression: Store_p + Store_p_store <= Store_p_max_pu / Store_max_hours * Store_e_nom_ext
description: '`Store-ext-p-upper` — an extendable store discharges at most the power rating of the
chosen build. A store without `max_hours` has no row'
Store_fix_e_lower:
dims: [scenario, snapshot, store]
where: not Store_e_nom_extendable AND Store_active
expression: Store_e >= Store_e_min_pu * Store_e_nom
description: '`Store-fix-e-lower` — a fixed store holds at least its floor'
Store_fix_e_upper:
dims: [scenario, snapshot, store]
where: not Store_e_nom_extendable AND Store_active
expression: Store_e <= Store_e_max_pu * Store_e_nom
description: '`Store-fix-e-upper` — a fixed store holds at most its nominal capacity'
Store_fix_p_lower:
dims: [scenario, snapshot, store]
where: NOT Store_e_nom_extendable AND Store_active AND (Store_split_dispatch OR Store_max_hours)
expression: Store_p + Store_p_store >= Store_discharge_floor_pu * Store_e_nom
description: '`Store-fix-p-lower` — a fixed store discharges at least its floor, which is zero where
it splits its dispatch and its most charging otherwise. A store that does not split and has no `max_hours`
has no row'
Store_fix_p_store_lower:
dims: [scenario, snapshot, store]
where: NOT Store_e_nom_extendable AND Store_active
expression: Store_p_store >= 0
description: '`Store-fix-p_store-lower` — charging is non-negative'
Store_fix_p_store_upper:
dims: [scenario, snapshot, store]
where: NOT Store_e_nom_extendable AND Store_active AND (NOT Store_split_dispatch OR Store_max_hours)
expression: Store_p_store <= Store_charge_cap_pu * Store_e_nom
description: '`Store-fix-p_store-upper` — a fixed store charges at most its power rating where it
splits its dispatch, and not at all where it does not. A store that splits and has no `max_hours`
has no row'
Store_fix_p_upper:
dims: [scenario, snapshot, store]
where: NOT Store_e_nom_extendable AND Store_active AND Store_max_hours
expression: Store_p + Store_p_store <= Store_p_max_pu / Store_max_hours * Store_e_nom
description: '`Store-fix-p-upper` — a fixed store discharges at most its power rating. A store without
`max_hours` has no row'
expressions:
Bus_injection:
dims: [bus, scenario, snapshot]
expression: (((Generator_injection + Link_injection) + Load_injection) + Process_injection) + Store_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
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
Link_injection: {expression: '-sum(Link_p, over=link, by=Link_bus0[bus]) + sum(Link_output_arrival,
over=link_output, by=Link_output_bus[bus])'}
Link_opex: {expression: 'sum(sum(((Link_p * Link_marginal_cost) * snapshot_weightings_objective) * at(period_weight_objective,
by=snapshot_period[period]), over=link), over=snapshot) + sum(sum((((Link_p * Link_p) * Link_marginal_cost_quadratic)
* snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=link),
over=snapshot)'}
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])'}
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
Store_capex: {expression: sum(scenario_weight * Store_e_nom_ext * Store_capital_cost * Store_capital_weight)}
Store_charge_cap_pu:
dims: [scenario, snapshot, store]
description: the most charging through `p_store`, per unit of `e_nom`. It is `-p_min_pu / max_hours`
for a store that splits its dispatch, and zero otherwise (`stores.py:79-86`)
cases:
split: {when: Store_split_dispatch, expression: -Store_p_min_pu / Store_max_hours}
otherwise: '0'
Store_discharge_floor_pu:
dims: [scenario, snapshot, store]
description: the least discharge, per unit of `e_nom`. It is zero for a store that splits its dispatch,
so `p_store` carries the charge. Otherwise it is the most charging as a negative discharge, `p_min_pu
/ max_hours` (`stores.py:79-86`)
cases:
split: {when: Store_split_dispatch, expression: '0'}
otherwise: Store_p_min_pu / Store_max_hours
Store_energy_carried_in:
dims: [scenario, snapshot, store]
description: the energy a store opens a snapshot with. At the first snapshot it is active in, it is
its last such snapshot's less standing loss where it is cyclic. Where it is not, it is the given
initial energy, which no standing loss has touched yet. Otherwise it is the previous snapshot's
less standing loss. A store built in a later period opens in that period, and a cyclic one that
retires closes on its own last snapshot. Per period, the same holds with each investment period
as the horizon
cases:
cyclic: {when: Store_e_cyclic AND NOT Store_e_cyclic_per_period AND NOT Store_e_initial_per_period
AND (position(snapshot) == 0 OR Store_opens_late), expression: 'Store_retention * shift(shift(Store_e,
along=snapshot, offset=1, edge=''wrap''), along=snapshot, offset=Store_inactive_snapshots, edge=''wrap'')'}
opening: {when: NOT Store_e_cyclic AND NOT Store_e_cyclic_per_period AND NOT Store_e_initial_per_period
AND (position(snapshot) == 0 OR Store_opens_late), expression: Store_e_initial}
period_cyclic: {when: Store_e_cyclic_per_period, expression: 'Store_retention * shift(Store_e, along=snapshot,
offset=1, edge=''wrap'', within=snapshot_period[period])'}
period_opening: {when: 'Store_e_initial_per_period AND NOT Store_e_cyclic_per_period AND position(snapshot,
within=snapshot_period[period]) == 0', expression: Store_e_initial}
otherwise: Store_retention * shift(Store_e, along=snapshot, offset=1)
Store_injection: {expression: 'sum(Store_sign * Store_p, over=store, by=Store_bus[bus])'}
Store_opex: {expression: 'sum(sum(((Store_p * Store_marginal_cost) * snapshot_weightings_objective)
* at(period_weight_objective, by=snapshot_period[period]), over=store), over=snapshot) + sum(sum((((Store_p
* Store_p) * Store_marginal_cost_quadratic) * snapshot_weightings_objective) * at(period_weight_objective,
by=snapshot_period[period]), over=store), over=snapshot) + sum(sum(((Store_e * Store_marginal_cost_storage)
* snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=store),
over=snapshot) + sum(sum((((Store_p + Store_p_store) * Store_marginal_cost_dispatch) * snapshot_weightings_objective)
* at(period_weight_objective, by=snapshot_period[period]), over=store), over=snapshot) + sum(sum(((Store_p_store
* Store_marginal_cost_store) * snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]),
over=store), over=snapshot) + sum(sum(((Store_spill * Store_spill_cost) * snapshot_weightings_objective)
* at(period_weight_objective, by=snapshot_period[period]), over=store), over=snapshot)'}
risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
scenario_opex:
dims: [scenario]
expression: (Generator_opex + Link_opex) + Store_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: Store_capex + 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'),
'Link_bus0': relation(n, 'Link', 'bus0'),
'Load_bus': relation(n, 'Load', 'bus'),
'Store_bus': relation(n, 'Store', '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'),
'snapshot_weightings_stores': weighting(n, 'stores'),
}
with sps.solve('differential/pypsa/rungs/rung_76_store_power.yaml', sources) as solution:
solution.objective # 11362.944444
The network, rung_76_store_power.py in the corpus — the spine plus what this rung adds:
# SPDX-FileCopyrightText: mathspec Contributors
#
# SPDX-License-Identifier: MIT
"""Rung 76: stores that cover a storage unit — a power rating through `max_hours`, an efficiency each way, inflow and spill, and a cost each way."""
from __future__ import annotations
import spine
def build():
"""The spine plus four stores: a rated battery with two efficiencies, a reservoir with inflow, an extendable lossy store and an unrated extendable one, under a swinging load."""
n = spine.build()
n.add(
'Store',
'battery76',
bus='south',
e_nom=40,
max_hours=2,
efficiency_store=0.9,
efficiency_dispatch=0.95,
marginal_cost_dispatch=1,
e_cyclic=True,
)
n.add(
'Store',
'reservoir76',
bus='south',
e_nom=60,
max_hours=4,
p_min_pu=0,
inflow=[20, 20, 20, 20],
spill_cost=2,
e_initial=50,
)
n.add(
'Store',
'ext76',
bus='south',
e_nom_extendable=True,
e_nom_max=80,
capital_cost=1,
max_hours=4,
efficiency_store=0.8,
marginal_cost_store=0.5,
e_cyclic=True,
)
n.add('Store', 'plain76', bus='north', e_nom_extendable=True, capital_cost=3, e_cyclic=True)
n.add('Load', 'swing76', bus='south', p_set=[0, 60, 0, 70])
return n
The data¶
The tables this rung is the first to declare (3), as the prep produced them:
Store_max_hours.csv
Store_p_max_pu.csv
scenario,snapshot,store,value
base,2015-01-01T00:00:00.000000,battery76,1.0
base,2015-01-01T00:00:00.000000,ext76,1.0
base,2015-01-01T00:00:00.000000,plain76,1.0
base,2015-01-01T00:00:00.000000,reservoir76,1.0
base,2015-01-01T01:00:00.000000,battery76,1.0
base,2015-01-01T01:00:00.000000,ext76,1.0
base,2015-01-01T01:00:00.000000,plain76,1.0
base,2015-01-01T01:00:00.000000,reservoir76,1.0
base,2015-01-01T02:00:00.000000,battery76,1.0
base,2015-01-01T02:00:00.000000,ext76,1.0
base,2015-01-01T02:00:00.000000,plain76,1.0
base,2015-01-01T02:00:00.000000,reservoir76,1.0
base,2015-01-01T03:00:00.000000,battery76,1.0
base,2015-01-01T03:00:00.000000,ext76,1.0
base,2015-01-01T03:00:00.000000,plain76,1.0
base,2015-01-01T03:00:00.000000,reservoir76,1.0
Store_spill_cost.csv
scenario,snapshot,store,value
base,2015-01-01T00:00:00.000000,battery76,0.0
base,2015-01-01T00:00:00.000000,ext76,0.0
base,2015-01-01T00:00:00.000000,plain76,0.0
base,2015-01-01T00:00:00.000000,reservoir76,2.0
base,2015-01-01T01:00:00.000000,battery76,0.0
base,2015-01-01T01:00:00.000000,ext76,0.0
base,2015-01-01T01:00:00.000000,plain76,0.0
base,2015-01-01T01:00:00.000000,reservoir76,2.0
base,2015-01-01T02:00:00.000000,battery76,0.0
base,2015-01-01T02:00:00.000000,ext76,0.0
base,2015-01-01T02:00:00.000000,plain76,0.0
base,2015-01-01T02:00:00.000000,reservoir76,2.0
base,2015-01-01T03:00:00.000000,battery76,0.0
base,2015-01-01T03:00:00.000000,ext76,0.0
base,2015-01-01T03:00:00.000000,plain76,0.0
base,2015-01-01T03:00:00.000000,reservoir76,2.0