Min Cost

Min Cost#

Minimum-cost redispatch algorithm.

API path: apem.unit_based_model.allocation.algorithms.zonal_clearing.redispatch.min_cost

class MinCostRD[source]#

Bases: RedispatchAlgorithm

Computes a redispatch solution that minimizes the total redispatch costs. Assumes that: - all generators can be redispatched - redispatch costs are based on the production costs from the zonal clearing stage - negative (downward) redispatch decreases the objective value - positive (upward) redispatch increases the objective value

compute_redispatch(
nodal_scenario,
zonal_allocation,
configuration,
path,
redispatch_constraint_units,
redispatch_threshold,
)[source]#

Computes a redispatch solution for a given zonal solution. The redispatch solution satisfies the constraints formulated based on a nodal scenario.

Parameters:

  • nodal_scenario (Scenario) – nodal scenario based on which constraints are formulated

  • zonal_allocation (SellersAllocation) – allocation computed with zonal clearing

  • configuration (SolverConfiguration) – values of some parameters to be set in the optimizer

  • path (str) – path to store the results

  • redispatch_constraint_units (bool) – True if all units can be used for redispatch, False otherwise

  • redispatch_threshold (float) – production threshold for filtering what units can be redispatched

Returns:

redispatch allocation or error

Return type:

Allocation | Error