Rung 29: storage per investment period — a storage unit and a store that cycle within each period, two that reopen on their initial level, and a ramp that restarts at a period start¶
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 7438.461538 on both sides; structure ✔ 17 constraints · 7 variables, name for name; size ✔ 244 rows · ✔ 112 columns · ✔ 388 nonzeros; duals ✔ 244 rows, 1 negated; model for model: 24 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 |
16 | 16 |
Generator-fix-p-upper |
16 | 16 |
Generator-p-ramp_limit_down |
6 | 6 |
Generator-p-ramp_limit_up |
6 | 6 |
StorageUnit-energy_balance |
16 | 16 |
StorageUnit-fix-p_dispatch-lower |
16 | 16 |
StorageUnit-fix-p_dispatch-upper |
16 | 16 |
StorageUnit-fix-p_store-lower |
16 | 16 |
StorageUnit-fix-p_store-upper |
16 | 16 |
StorageUnit-fix-state_of_charge-lower |
16 | 16 |
StorageUnit-fix-state_of_charge-upper |
16 | 16 |
Store-energy_balance |
16 | 16 |
Store-fix-e-lower |
16 | 16 |
Store-fix-e-upper |
16 | 16 |
Store-fix-p_store-lower |
16 | 16 |
Store-fix-p_store-upper |
16 | 16 |
| column | PyPSA | specsolve |
|---|---|---|
Generator-p |
16 | 16 |
StorageUnit-p_dispatch |
16 | 16 |
StorageUnit-p_store |
16 | 16 |
StorageUnit-state_of_charge |
16 | 16 |
Store-e |
16 | 16 |
Store-p |
16 | 16 |
Store-p_store |
16 | 16 |
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\_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{StorageUnit\_bus}: \mathcal{S} \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\_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{S}\) | index \(s\) — storage_unit with \(\mathrm{StorageUnit\_bus}: \mathcal{S} \to \mathcal{N}\) — storage units, dispatch and store behind one bus connection |
| \(\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 |
| \(\mathrm{N}^{\mathrm{fix}}\) | Generator_modules_installed over \(\mathcal{G} \times \Xi\) — how many whole modules a committable build has in place, data prep. It is Generator_p_nom / Generator_p_nom_mod where a fixed build is modular, and one where it is not. PyPSA refuses a fixed modular build whose nominal power is not a whole number of modules |
| \(\mathrm{p}^{0}\) | Generator_p_init over \(\mathcal{G} \times \Xi\), \(0\) where the data has no row — the output a unit brought into the horizon, data prep. It is PyPSA's p_init where the unit came in running, and zero where it came in off. Under a rolling horizon, it is the output the previous window solved. No value means it is unknown, and the unit then has no ramp row at the first snapshot |
| \(\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{p}^{\mathrm{mod}}\) | Generator_p_nom_mod over \(\mathcal{G}\), absent where the data has no row — the module size a build comes in whole numbers of. No value means the build is continuous |
| \(\mathrm{rd}\) | Generator_ramp_limit_down over \(\mathcal{G} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a generator may lower its output between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time |
| \(\mathrm{rd}^{\mathrm{dn}}\) | Generator_ramp_limit_shut_down over \(\mathcal{G} \times \Xi\), absent where the data has no row — most output in the snapshot before a unit stops, per unit of nominal power. No value means no limit |
| \(\mathrm{ru}^{\mathrm{up}}\) | Generator_ramp_limit_start_up over \(\mathcal{G} \times \Xi\), absent where the data has no row — most output in the snapshot a unit starts, per unit of nominal power. No value means no limit |
| \(\mathrm{ru}\) | Generator_ramp_limit_up over \(\mathcal{G} \times \Xi \times \mathcal{T}\), absent where the data has no row — most a generator may raise its output between snapshots, per unit of nominal power. No value means no limit. The value at the later of the two snapshots applies, so the limit may change over time |
| \(\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{u}^{0}\) | Generator_status_initial over \(\mathcal{G} \times \Xi\) — one where the unit was on before the first snapshot, zero where off. It is PyPSA's up_time_before > 0 for a committable unit, and one for a unit that is not, whose ramp rows PyPSA starts from on (constraints.py:323), data prep. Under a rolling horizon, it is the status the previous window solved, a fraction where unit commitment is linearised |
| \(\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}^{h}\) | StorageUnit_active over \(\mathcal{T} \times \mathcal{S}\) — whether a storage unit is active in a snapshot's period. It is PyPSA's active, data prep |
| \(\mathrm{cyc}\) | StorageUnit_cyclic_state_of_charge over \(\Xi \times \mathcal{S}\) — whether the horizon closes on itself instead of opening on the initial charge |
| \(\mathrm{cyc}^{y}\) | StorageUnit_cyclic_state_of_charge_per_period over \(\Xi \times \mathcal{S}\) — whether each investment period closes on itself instead of carrying its charge on to the next. It overrides cyclic_state_of_charge and state_of_charge_initial_per_period. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep |
| \(\eta^{+}\) | StorageUnit_efficiency_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of the charge drawn down that reaches the bus |
| \(\eta^{-}\) | StorageUnit_efficiency_store over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of the power drawn from the bus that becomes charge |
| \(\mathrm{idle}\) | StorageUnit_inactive_snapshots over \(\mathcal{S}\) — how many snapshots a storage unit is not active in. It is PyPSA's (~active).sum(), data prep. A cyclic unit reaches back this many snapshots further, so it closes on the last snapshot it is active in |
| \(\mathrm{inflow}\) | StorageUnit_inflow over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — energy arriving per hour, a river into a reservoir |
| \(\mathrm{c}^{h}\) | StorageUnit_marginal_cost over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of one unit of dispatch |
| \(\mathrm{c}^{h,(2)}\) | StorageUnit_marginal_cost_quadratic over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of the square of one unit of dispatch. Storing is not charged |
| \(\mathrm{c}^{\mathrm{soc}}\) | StorageUnit_marginal_cost_storage over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — cost of one unit of charge held over one snapshot |
| \(\mathrm{T}^{h}\) | StorageUnit_max_hours over \(\Xi \times \mathcal{S}\) — energy capacity, as hours of dispatch at nominal power |
| \(\mathrm{open}\) | StorageUnit_opens_late over \(\mathcal{T} \times \mathcal{S}\) — whether a snapshot is the first a storage unit 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 unit is active throughout |
| \(\overline{\mathrm{h}}\) | StorageUnit_p_max_pu over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — most dispatch, per unit of nominal power |
| \(\underline{\mathrm{h}}\) | StorageUnit_p_min_pu over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — most storing, per unit of nominal power and negated |
| \(\mathrm{h}^{\mathrm{nom}}\) | StorageUnit_p_nom over \(\Xi \times \mathcal{S}\) — nominal power |
| \(\mathrm{ext}^{h}\) | StorageUnit_p_nom_extendable over \(\mathcal{S}\) — whether the nominal power is a decision |
| \(\rho\) | StorageUnit_retention over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — share of charge kept over a snapshot. It is PyPSA's (1 - standing_loss) ** elapsed hours, data prep |
| \(\mathrm{sgn}^{h}\) | StorageUnit_sign over \(\mathcal{S}\) — the sign net dispatch 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{soc}^{0}\) | StorageUnit_state_of_charge_initial over \(\Xi \times \mathcal{S}\) — charge held before the first snapshot |
| \(\mathrm{reset}\) | StorageUnit_state_of_charge_initial_per_period over \(\Xi \times \mathcal{S}\) — whether each investment period opens on the initial charge instead of carrying the previous period's. PyPSA reads it only under multi_investment_periods. Otherwise you feed false in data prep |
| \(\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{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 |
| \(\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 |
| \(\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{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\_committed}\) | Generator_committed over \(\mathcal{G} \times \mathcal{T}\) — a committable generator that is active in the snapshot's period: every unit-commitment row's set |
| \(\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) |
| \(\mathrm{Generator\_ramps\_from\_previous}\) | Generator_ramps_from_previous over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — a snapshot whose ramp uses a previous output. It is any snapshot but its period's first, and the horizon's first where the generator comes in off or carries an initial output |
| \(\mathrm{StorageUnit\_fix}\) | StorageUnit_fix over \(\mathcal{T} \times \mathcal{S}\) — a storage unit with a fixed build that is active in the snapshot's period. It is PyPSA's fix rows |
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 |
| \(P\) | Generator_p_nom_ext over \(\mathcal{G}\) — Generator-p_nom — nominal power where it is a decision, for a generator that is active. A fixed build is the parameter of the same PyPSA name |
| \(u\) | Generator_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — Generator-status — how much of a committable unit is on. It is an integer the rows below cap at one, or at the module count where the build is modular |
| \(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 |
| \(h^{+}\) | StorageUnit_p_dispatch over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-p_dispatch — power delivered to the bus |
| \(h^{-}\) | StorageUnit_p_store over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-p_store — power drawn from the bus into charge |
| \(\mathit{soc}\) | StorageUnit_state_of_charge over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — StorageUnit-state_of_charge — energy held at the end of a snapshot |
| \(e\) | Store_e over \(\Xi \times \mathcal{T} \times \mathcal{V}\) — Store-e — energy held at the end of a snapshot |
| \(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 |
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\_p\_carried\_over}\) | Generator_p_carried_over over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the output a generator carries over into a snapshot. At the first, it is the p_init it brought in, which is zero where it came in off. After that, it is the previous snapshot's |
| \(\mathrm{Generator\_p\_nom\_committed}\) | Generator_p_nom_committed over \(\mathcal{G} \times \Xi\) — the build a committed unit's ramp rows are taken against: one module where the build is modular, since its status counts modules, and the given build otherwise (constraints.py:1131-1134) |
| \(\mathit{Generator\_p\_nom\_effective}\) | Generator_p_nom_effective over \(\mathcal{G} \times \Xi\) — the build a generator's limits are taken against: the chosen one where it is extendable, the given one otherwise |
| \(\mathit{Generator\_previous\_p}\) | Generator_previous_p over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the output a generator carries into a snapshot. It is nothing at the first snapshot it is active in past the first of the horizon: PyPSA fills an output it did not build with zero (constraints.py:716). It is the output carried over otherwise |
| \(\mathit{Generator\_previous\_status}\) | Generator_previous_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the commitment state a generator carries into a snapshot. It is off at the first snapshot it is active in past the first of the horizon. PyPSA reads a status it did not build as off there (constraints.py:391). It is the state carried over otherwise |
| \(\mathit{Generator\_ramp\_down\_allowance}\) | Generator_ramp_down_allowance over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — how far a generator may lower output between two snapshots. It is its ramp limit of the build while it stays on, plus its shut-down ramp in the snapshot it turns off |
| \(\mathrm{Generator\_ramp\_down\_rate}\) | Generator_ramp_down_rate over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the ramp limit in a unit's down row, PyPSA's ramp_limit_down. It is the full build where PyPSA has none, since a shut-down ramp alone builds the row |
| \(\mathit{Generator\_ramp\_previous\_status}\) | Generator_ramp_previous_status over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the status a committed unit's ramp rows carry into a snapshot. At the first snapshot, a fixed modular unit that came in running has every module on, since the state it brought in is on or off (constraints.py:1152-1157). The transition and down-time rows count it as one module (PyPSA/PyPSA#2114). It is the state carried in otherwise |
| \(\mathit{Generator\_ramp\_up\_allowance}\) | Generator_ramp_up_allowance over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — how far a generator may raise output between two snapshots. It is its ramp limit of the build while it stays on, plus its start-up ramp in the snapshot it turns on |
| \(\mathrm{Generator\_ramp\_up\_rate}\) | Generator_ramp_up_rate over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the ramp limit in a unit's up row, PyPSA's ramp_limit_up. It is the full build where PyPSA has none, since a start-up ramp alone builds the row |
| \(\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) |
| \(\mathrm{Generator\_shut\_down\_rate}\) | Generator_shut_down_rate over \(\mathcal{G} \times \Xi\) — the shut-down ramp in a unit's down row (PyPSA's ramp_limit_shut_down), or the full build where it has none |
| \(\mathrm{Generator\_start\_up\_rate}\) | Generator_start_up_rate over \(\mathcal{G} \times \Xi\) — the start-up ramp in a unit's up row (PyPSA's ramp_limit_start_up), or the full build where it has none |
| \(\mathit{Generator\_status\_carried\_over}\) | Generator_status_carried_over over \(\mathcal{G} \times \Xi \times \mathcal{T}\) — the state a generator carries over into a snapshot: the state it brought into the horizon at the first, the previous snapshot's after that |
| \(\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{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{StorageUnit\_charge\_carried\_in}\) | StorageUnit_charge_carried_in over \(\Xi \times \mathcal{T} \times \mathcal{S}\) — the charge a unit 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 charge, which no standing loss has touched yet. Otherwise it is the previous snapshot's less standing loss. A unit 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{StorageUnit\_injection}\) | StorageUnit_injection over \(\mathcal{N} \times \Xi \times \mathcal{T}\) |
| \(\mathit{StorageUnit\_opex}\) | StorageUnit_opex over \(\Xi\) |
| \(\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) |
| \(\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_committed
Generator_marginal_cost_curve
Generator_ramps_from_previous
StorageUnit_fix
Variable domains¶
Generator_marginal_cost_piecewise
Generator_p
Generator_p_nom_ext
Generator_status
Link_p
Process_p
StorageUnit_p_dispatch
StorageUnit_p_store
StorageUnit_state_of_charge
Store_e
Store_p
Store_p_store
Definitions¶
Bus_injection
Generator_injection
Generator_opex
Generator_p_carried_over
Generator_p_nom_committed
Generator_p_nom_effective
Generator_previous_p
Generator_previous_status
Generator_ramp_down_allowance
Generator_ramp_down_rate
Generator_ramp_previous_status
Generator_ramp_up_allowance
Generator_ramp_up_rate
Generator_running_cost
Generator_shut_down_rate
Generator_start_up_rate
Generator_status_carried_over
Link_injection
Link_output_arrival
Load_demand
Load_injection
Process_injection
Process_output_arrival
StorageUnit_charge_carried_in
StorageUnit_injection
StorageUnit_opex
Store_charge_cap_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
Generator_p_ramp_limit_down
Generator_p_ramp_limit_up
StorageUnit_energy_balance
StorageUnit_fix_p_dispatch_lower
StorageUnit_fix_p_dispatch_upper
StorageUnit_fix_p_store_lower
StorageUnit_fix_p_store_upper
StorageUnit_fix_state_of_charge_lower
StorageUnit_fix_state_of_charge_upper
Store_energy_balance
Store_fix_e_lower
Store_fix_e_upper
Store_fix_p_store_lower
Store_fix_p_store_upper
The spec, differential/pypsa/rungs/rung_29_storage_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}
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}
storage_unit: {description: 'storage units, dispatch and store behind one bus connection'}
store: {description: 'pure energy stores, each on one bus'}
relations:
Generator_bus: {key: generator, values: bus, description: the bus a generator sits on}
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}
StorageUnit_bus: {key: storage_unit, values: bus, description: the bus a storage unit sits on}
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_modules_installed:
dims: [generator, scenario]
description: how many whole modules a committable build has in place, data prep. It is `Generator_p_nom
/ Generator_p_nom_mod` where a fixed build is modular, and one where it is not. PyPSA refuses a
fixed modular build whose nominal power is not a whole number of modules
Generator_p_init:
dims: [generator, scenario]
missing: 0.0
description: the output a unit brought into the horizon, data prep. It is PyPSA's `p_init` where the
unit came in running, and zero where it came in off. Under a rolling horizon, it is the output the
previous window solved. No value means it is unknown, and the unit then has no ramp row at the first
snapshot
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_p_nom_mod:
dims: [generator]
missing: absent
description: the module size a build comes in whole numbers of. No value means the build is continuous
Generator_ramp_limit_down:
dims: [generator, scenario, snapshot]
missing: absent
description: most a generator may lower its output between snapshots, per unit of nominal power. No
value means no limit. The value at the later of the two snapshots applies, so the limit may change
over time
Generator_ramp_limit_shut_down:
dims: [generator, scenario]
missing: absent
description: most output in the snapshot before a unit stops, per unit of nominal power. No value
means no limit
Generator_ramp_limit_start_up:
dims: [generator, scenario]
missing: absent
description: most output in the snapshot a unit starts, per unit of nominal power. No value means
no limit
Generator_ramp_limit_up:
dims: [generator, scenario, snapshot]
missing: absent
description: most a generator may raise its output between snapshots, per unit of nominal power. No
value means no limit. The value at the later of the two snapshots applies, so the limit may change
over time
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`)
Generator_status_initial:
dims: [generator, scenario]
description: one where the unit was on before the first snapshot, zero where off. It is PyPSA's `up_time_before
> 0` for a committable unit, and one for a unit that is not, whose ramp rows PyPSA starts from on
(`constraints.py:323`), data prep. Under a rolling horizon, it is the status the previous window
solved, a fraction where unit commitment is linearised
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`)
StorageUnit_active:
dims: [snapshot, storage_unit]
dtype: bool
description: whether a storage unit is active in a snapshot's period. It is PyPSA's `active`, data
prep
StorageUnit_cyclic_state_of_charge:
dims: [scenario, storage_unit]
dtype: bool
description: whether the horizon closes on itself instead of opening on the initial charge
StorageUnit_cyclic_state_of_charge_per_period:
dims: [scenario, storage_unit]
dtype: bool
description: whether each investment period closes on itself instead of carrying its charge on to
the next. It overrides `cyclic_state_of_charge` and `state_of_charge_initial_per_period`. PyPSA
reads it only under `multi_investment_periods`. Otherwise you feed false in data prep
StorageUnit_efficiency_dispatch:
dims: [scenario, snapshot, storage_unit]
description: share of the charge drawn down that reaches the bus
StorageUnit_efficiency_store:
dims: [scenario, snapshot, storage_unit]
description: share of the power drawn from the bus that becomes charge
StorageUnit_inactive_snapshots:
dims: [storage_unit]
dtype: int
description: how many snapshots a storage unit is not active in. It is PyPSA's `(~active).sum()`,
data prep. A cyclic unit reaches back this many snapshots further, so it closes on the last snapshot
it is active in
StorageUnit_inflow:
dims: [scenario, snapshot, storage_unit]
description: energy arriving per hour, a river into a reservoir
StorageUnit_marginal_cost:
dims: [scenario, snapshot, storage_unit]
description: cost of one unit of dispatch
StorageUnit_marginal_cost_quadratic:
dims: [scenario, snapshot, storage_unit]
description: cost of the square of one unit of dispatch. Storing is not charged
StorageUnit_marginal_cost_storage:
dims: [scenario, snapshot, storage_unit]
description: cost of one unit of charge held over one snapshot
StorageUnit_max_hours:
dims: [scenario, storage_unit]
description: energy capacity, as hours of dispatch at nominal power
StorageUnit_opens_late:
dims: [snapshot, storage_unit]
dtype: bool
description: whether a snapshot is the first a storage unit 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 unit is active throughout
StorageUnit_p_max_pu:
dims: [scenario, snapshot, storage_unit]
description: most dispatch, per unit of nominal power
StorageUnit_p_min_pu:
dims: [scenario, snapshot, storage_unit]
description: most storing, per unit of nominal power and negated
StorageUnit_p_nom:
dims: [scenario, storage_unit]
description: nominal power
StorageUnit_p_nom_extendable:
dims: [storage_unit]
dtype: bool
description: whether the nominal power is a decision
StorageUnit_retention:
dims: [scenario, snapshot, storage_unit]
description: share of charge kept over a snapshot. It is PyPSA's `(1 - standing_loss) ** elapsed hours`,
data prep
StorageUnit_sign:
dims: [storage_unit]
description: the sign net dispatch enters its bus's balance with. It is PyPSA's `sign`, `1` unless
given. PyPSA refuses one that differs by scenario (`constants.py:46`)
StorageUnit_state_of_charge_initial:
dims: [scenario, storage_unit]
description: charge held before the first snapshot
StorageUnit_state_of_charge_initial_per_period:
dims: [scenario, storage_unit]
dtype: bool
description: whether each investment period opens on the initial charge instead of carrying the previous
period's. PyPSA reads it only under `multi_investment_periods`. Otherwise you feed false in data
prep
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_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_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_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_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'
StorageUnit_p_dispatch:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_active
description: '`StorageUnit-p_dispatch` — power delivered to the bus'
StorageUnit_p_store:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_active
description: '`StorageUnit-p_store` — power drawn from the bus into charge'
StorageUnit_state_of_charge:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_active
description: '`StorageUnit-state_of_charge` — energy held at the end of a snapshot'
Store_e:
dims: [scenario, snapshot, store]
where: Store_active
description: '`Store-e` — energy held at the end of a snapshot'
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'
Generator_status:
dims: [generator, scenario, snapshot]
where: Generator_committed
bounds: {lower: 0.0}
domain: integer
description: '`Generator-status` — how much of a committable unit is on. It is an integer the rows
below cap at one, or at the module count where the build is modular'
Generator_p_nom_ext:
dims: [generator]
where: Generator_p_nom_extendable AND Generator_active_asset
description: '`Generator-p_nom` — nominal power where it is a decision, for a generator that is active.
A fixed build is the parameter of the same PyPSA name'
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'
Generator_p_ramp_limit_down:
dims: [generator, scenario, snapshot]
where: (Generator_ramp_limit_down OR Generator_ramp_limit_shut_down) AND NOT (Generator_committable
AND Generator_p_nom_extendable AND NOT (Generator_p_nom_mod > 0)) AND Generator_ramps_from_previous
AND Generator_active
expression: Generator_previous_p - Generator_p <= Generator_ramp_down_allowance
description: '`Generator-p-ramp_limit_down` — a generator lowers output no faster than its ramp limit
of the build. A committed one lowers it no further than its shut-down ramp in the snapshot it turns
off. A unit that came into the horizon running has a row at the first snapshot only where its `p_init`
gives the output it brought in. No unit has one at the start of a later investment period, nor does
any unit a big M releases instead'
Generator_p_ramp_limit_up:
dims: [generator, scenario, snapshot]
where: (Generator_ramp_limit_up OR Generator_ramp_limit_start_up) AND NOT (Generator_committable AND
Generator_p_nom_extendable AND NOT (Generator_p_nom_mod > 0)) AND Generator_ramps_from_previous
AND Generator_active
expression: Generator_p - Generator_previous_p <= Generator_ramp_up_allowance
description: '`Generator-p-ramp_limit_up` — a generator raises output no faster than its ramp limit
of the build. A committed one raises it no further than its start-up ramp in the snapshot it turns
on. A unit that came into the horizon running has a row at the first snapshot only where its `p_init`
gives the output it brought in. No unit has one at the start of a later investment period, nor does
any unit a big M releases instead'
StorageUnit_energy_balance:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_active
expression: ((StorageUnit_charge_carried_in + ((StorageUnit_efficiency_store * StorageUnit_p_store)
* snapshot_weightings_stores)) - ((StorageUnit_p_dispatch * snapshot_weightings_stores) / StorageUnit_efficiency_dispatch))
+ (StorageUnit_inflow * snapshot_weightings_stores) == StorageUnit_state_of_charge
description: '`StorageUnit-energy_balance` — the charge carried in, plus what is stored after its
efficiency, less what dispatch draws down before its own, plus inflow not spilled'
StorageUnit_fix_p_dispatch_lower:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_p_dispatch >= 0
description: '`StorageUnit-fix-p_dispatch-lower` — dispatch is non-negative'
StorageUnit_fix_p_dispatch_upper:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_p_dispatch <= StorageUnit_p_max_pu * StorageUnit_p_nom
description: '`StorageUnit-fix-p_dispatch-upper` — a fixed unit dispatches at most its nominal power'
StorageUnit_fix_p_store_lower:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_p_store >= 0
description: '`StorageUnit-fix-p_store-lower` — storing is non-negative'
StorageUnit_fix_p_store_upper:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_p_store <= -StorageUnit_p_min_pu * StorageUnit_p_nom
description: '`StorageUnit-fix-p_store-upper` — a fixed unit stores at most its nominal power, the
minimum-per-unit column carrying that cap negated'
StorageUnit_fix_state_of_charge_lower:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_state_of_charge >= 0
description: '`StorageUnit-fix-state_of_charge-lower` — charge is non-negative'
StorageUnit_fix_state_of_charge_upper:
dims: [scenario, snapshot, storage_unit]
where: StorageUnit_fix
expression: StorageUnit_state_of_charge <= StorageUnit_max_hours * StorageUnit_p_nom
description: '`StorageUnit-fix-state_of_charge-upper` — a fixed unit holds at most its hours at 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 * 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_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_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'
expressions:
Bus_injection:
dims: [bus, scenario, snapshot]
expression: ((((Generator_injection + Link_injection) + Load_injection) + Process_injection) + StorageUnit_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_p_carried_over:
dims: [generator, scenario, snapshot]
description: the output a generator carries over into a snapshot. At the first, it is the `p_init`
it brought in, which is zero where it came in off. After that, it is the previous snapshot's
cases:
opening: {when: position(snapshot) == 0, expression: Generator_p_init}
otherwise: shift(Generator_p, along=snapshot, offset=1)
Generator_p_nom_committed:
dims: [generator, scenario]
description: 'the build a committed unit''s ramp rows are taken against: one module where the build
is modular, since its status counts modules, and the given build otherwise (`constraints.py:1131-1134`)'
cases:
modular_build: {when: Generator_p_nom_mod > 0, expression: Generator_p_nom_mod}
otherwise: Generator_p_nom
Generator_p_nom_effective:
dims: [generator, scenario]
description: 'the build a generator''s limits are taken against: the chosen one where it is extendable,
the given one otherwise'
cases:
extendable: {when: Generator_p_nom_extendable, expression: Generator_p_nom_ext}
otherwise: Generator_p_nom
Generator_previous_p:
dims: [generator, scenario, snapshot]
description: 'the output a generator carries into a snapshot. It is nothing at the first snapshot
it is active in past the first of the horizon: PyPSA fills an output it did not build with zero
(`constraints.py:716`). It is the output carried over otherwise'
cases:
opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Generator_active, along=snapshot, offset=1)',
expression: '0'}
otherwise: Generator_p_carried_over
Generator_previous_status:
dims: [generator, scenario, snapshot]
description: the commitment state a generator carries into a snapshot. It is off at the first snapshot
it is active in past the first of the horizon. PyPSA reads a status it did not build as off there
(`constraints.py:391`). It is the state carried over otherwise
cases:
opening_late: {when: 'position(snapshot) > 0 AND NOT shift(Generator_active, along=snapshot, offset=1)',
expression: '0'}
otherwise: Generator_status_carried_over
Generator_ramp_down_allowance:
dims: [generator, scenario, snapshot]
description: how far a generator may lower output between two snapshots. It is its ramp limit of the
build while it stays on, plus its shut-down ramp in the snapshot it turns off
cases:
committed: {when: Generator_committable, expression: Generator_ramp_down_rate * Generator_p_nom_committed
* Generator_status + Generator_shut_down_rate * Generator_p_nom_committed * (Generator_ramp_previous_status
- Generator_status)}
otherwise: Generator_ramp_down_rate * Generator_p_nom_effective
Generator_ramp_down_rate:
dims: [generator, scenario, snapshot]
description: the ramp limit in a unit's down row, PyPSA's `ramp_limit_down`. It is the full build
where PyPSA has none, since a shut-down ramp alone builds the row
cases:
given: {when: Generator_ramp_limit_down, expression: Generator_ramp_limit_down}
otherwise: '1'
Generator_ramp_previous_status:
dims: [generator, scenario, snapshot]
description: the status a committed unit's ramp rows carry into a snapshot. At the first snapshot,
a fixed modular unit that came in running has every module on, since the state it brought in is
on or off (`constraints.py:1152-1157`). The transition and down-time rows count it as one module
(PyPSA/PyPSA#2114). It is the state carried in otherwise
cases:
opening_modules: {when: position(snapshot) == 0 AND NOT Generator_p_nom_extendable AND Generator_p_nom_mod
> 0, expression: Generator_status_initial * Generator_modules_installed}
otherwise: Generator_previous_status
Generator_ramp_up_allowance:
dims: [generator, scenario, snapshot]
description: how far a generator may raise output between two snapshots. It is its ramp limit of the
build while it stays on, plus its start-up ramp in the snapshot it turns on
cases:
committed: {when: Generator_committable, expression: Generator_ramp_up_rate * Generator_p_nom_committed
* Generator_ramp_previous_status + Generator_start_up_rate * Generator_p_nom_committed * (Generator_status
- Generator_ramp_previous_status)}
otherwise: Generator_ramp_up_rate * Generator_p_nom_effective
Generator_ramp_up_rate:
dims: [generator, scenario, snapshot]
description: the ramp limit in a unit's up row, PyPSA's `ramp_limit_up`. It is the full build where
PyPSA has none, since a start-up ramp alone builds the row
cases:
given: {when: Generator_ramp_limit_up, expression: Generator_ramp_limit_up}
otherwise: '1'
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
Generator_shut_down_rate:
dims: [generator, scenario]
description: the shut-down ramp in a unit's down row (PyPSA's `ramp_limit_shut_down`), or the full
build where it has none
cases:
given: {when: Generator_ramp_limit_shut_down, expression: Generator_ramp_limit_shut_down}
otherwise: '1'
Generator_start_up_rate:
dims: [generator, scenario]
description: the start-up ramp in a unit's up row (PyPSA's `ramp_limit_start_up`), or the full build
where it has none
cases:
given: {when: Generator_ramp_limit_start_up, expression: Generator_ramp_limit_start_up}
otherwise: '1'
Generator_status_carried_over:
dims: [generator, scenario, snapshot]
description: 'the state a generator carries over into a snapshot: the state it brought into the horizon
at the first, the previous snapshot''s after that'
cases:
opening: {when: position(snapshot) == 0, expression: Generator_status_initial}
otherwise: shift(Generator_status, along=snapshot, offset=1)
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])'}
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
StorageUnit_charge_carried_in:
dims: [scenario, snapshot, storage_unit]
description: the charge a unit 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 charge, which no standing loss has touched yet. Otherwise it is the previous snapshot's
less standing loss. A unit 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: StorageUnit_cyclic_state_of_charge AND NOT StorageUnit_cyclic_state_of_charge_per_period
AND NOT StorageUnit_state_of_charge_initial_per_period AND (position(snapshot) == 0 OR StorageUnit_opens_late),
expression: 'StorageUnit_retention * shift(shift(StorageUnit_state_of_charge, along=snapshot,
offset=1, edge=''wrap''), along=snapshot, offset=StorageUnit_inactive_snapshots, edge=''wrap'')'}
opening: {when: NOT StorageUnit_cyclic_state_of_charge AND NOT StorageUnit_cyclic_state_of_charge_per_period
AND NOT StorageUnit_state_of_charge_initial_per_period AND (position(snapshot) == 0 OR StorageUnit_opens_late),
expression: StorageUnit_state_of_charge_initial}
period_cyclic: {when: StorageUnit_cyclic_state_of_charge_per_period, expression: 'StorageUnit_retention
* shift(StorageUnit_state_of_charge, along=snapshot, offset=1, edge=''wrap'', within=snapshot_period[period])'}
period_opening: {when: 'StorageUnit_state_of_charge_initial_per_period AND NOT StorageUnit_cyclic_state_of_charge_per_period
AND position(snapshot, within=snapshot_period[period]) == 0', expression: StorageUnit_state_of_charge_initial}
otherwise: StorageUnit_retention * shift(StorageUnit_state_of_charge, along=snapshot, offset=1)
StorageUnit_injection: {expression: 'sum(StorageUnit_sign * (StorageUnit_p_dispatch - StorageUnit_p_store),
over=storage_unit, by=StorageUnit_bus[bus])'}
StorageUnit_opex: {expression: '(sum(sum(((StorageUnit_p_dispatch * StorageUnit_marginal_cost) * snapshot_weightings_objective)
* at(period_weight_objective, by=snapshot_period[period]), over=storage_unit), over=snapshot) +
sum(sum((((StorageUnit_p_dispatch * StorageUnit_p_dispatch) * StorageUnit_marginal_cost_quadratic)
* snapshot_weightings_objective) * at(period_weight_objective, by=snapshot_period[period]), over=storage_unit),
over=snapshot)) + sum(sum(((StorageUnit_state_of_charge * StorageUnit_marginal_cost_storage) * snapshot_weightings_objective)
* at(period_weight_objective, by=snapshot_period[period]), over=storage_unit), over=snapshot)'}
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_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)'}
risk_weighted_opex: {expression: 'sum(scenario_weight * scenario_opex, over=scenario)'}
scenario_opex:
dims: [scenario]
expression: (Generator_opex + StorageUnit_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: 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_committed: {condition: Generator_committable AND Generator_active, description: 'a committable
generator that is active in the snapshot''s period: every unit-commitment row''s set'}
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`)'}
Generator_ramps_from_previous: {condition: 'position(snapshot, within=snapshot_period[period]) > 0 OR
(position(snapshot) == 0 AND (Generator_status_initial == 0 OR Generator_p_init))', description: 'a
snapshot whose ramp uses a previous output. It is any snapshot but its period''s first, and the
horizon''s first where the generator comes in off or carries an initial output'}
StorageUnit_fix: {condition: NOT StorageUnit_p_nom_extendable AND StorageUnit_active, description: a
storage unit with a fixed build that is active in the snapshot's period. It is PyPSA's `fix` rows}
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'),
'StorageUnit_bus': relation(n, 'StorageUnit', '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_29_storage_per_period.yaml', sources) as solution:
solution.objective # 7438.461538
The network, rung_29_storage_per_period.py in the corpus — the spine plus what this rung adds:
# SPDX-FileCopyrightText: mathspec Contributors
#
# SPDX-License-Identifier: MIT
"""Rung 29: storage per investment period — a storage unit and a store that cycle within each period, two that reopen on their initial level, and a ramp that restarts at a period start."""
from __future__ import annotations
from datetime import datetime
import pandas as pd
OPTIMIZE = {'multi_investment_periods': True}
def build():
"""A whole network, not the spine: eight snapshots over two periods, four storages that each close or reopen per period, a ramp-limited coal unit."""
import pypsa
n = pypsa.Network()
n.snapshots = pd.MultiIndex.from_tuples(
[(2020, datetime(2020, 1, 1, t)) for t in range(4)] + [(2030, datetime(2030, 1, 1, t)) for t in range(4)]
)
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, 2.0, 2.0, 1.5, 2.5, 2.0]
n.snapshot_weightings['stores'] = [0.5, 2.0, 1.5, 2.5, 0.5, 2.0, 1.5, 2.5]
n.add('Bus', 'hub')
n.add('Generator', 'coal29', bus='hub', p_nom=100, marginal_cost=10, ramp_limit_up=0.1, ramp_limit_down=0.1)
n.add('Generator', 'peak29', bus='hub', p_nom=200, marginal_cost=[80, 20, 90, 30, 80, 20, 90, 30])
n.add('StorageUnit', 'su_cycle', bus='hub', p_nom=15, max_hours=4, cyclic_state_of_charge_per_period=True)
n.add(
'StorageUnit',
'su_reset',
bus='hub',
p_nom=15,
max_hours=4,
state_of_charge_initial=20,
state_of_charge_initial_per_period=True,
)
n.add('Store', 'e_cycle', bus='hub', e_nom=30, e_cyclic_per_period=True)
n.add('Store', 'e_reset', bus='hub', e_nom=30, e_initial=10, e_initial_per_period=True)
n.add('Load', 'hub_load', bus='hub', p_set=[40, 60, 70, 40, 90, 110, 120, 90])
return n
The data¶
Every table this spec declares was first declared by a lower rung; its values here are in the prep above.