pub struct SmoothedLoadOptimization<T> {
    pub d: i32,
    pub t_end: i32,
    pub bounds: Vec<T>,
    pub switching_cost: Vec<f64>,
    pub hitting_cost: Vec<f64>,
    pub load: Vec<T>,
}
Expand description

Smoothed Load Optimization (SLO).

  • SSCO
  • hitting costs are time independent and linear in some incoming load

Fields

d: i32

Number of dimensions.

t_end: i32

Finite, positive time horizon.

bounds: Vec<T>

Vector of upper bounds of each dimension.

switching_cost: Vec<f64>

Vector of positive real constants resembling the switching cost of each dimension (strictly ascending). Dimensions must be efficient, i.e. there must not be dimensions with a higher switching and higher hitting cost than onether dimension.

hitting_cost: Vec<f64>

Time-independent cost of each dimension (strictly descending).

load: Vec<T>

Non-negative load at each time step.

Implementations

Convert instance to an instance of Smoothed Balanced-Load Optimization.

Trait Implementations

Number of dimensions.

Finite, positive time horizon.

Updates the time horizon.

Increases the time horizon by one time step.

Returns a copy of the value. Read more

Performs copy-assignment from source. Read more

Formats the value using the given formatter. Read more

Notes:

  • Only allows for a single location, source, and job type.
  • Assumes full utilization and averages the energy cost over the time horizon.

Performs an online update of the given problem instance $o$ with some $input$ (which may be uncertain).

Hitting cost.

Movement cost.

Objective function. Calculates the cost of a schedule.

Inverted Objective function. Calculates the cost of a schedule. Pays the switching cost for powering down rather than powering up. Read more

$\alpha$-unfair Objective function. Calculates the cost of a schedule.

Objective function starting from an initial configuration other than $\mathbf{0}$.

Movement in the decision space.

Auto Trait Implementations

Blanket Implementations

Gets the TypeId of self. Read more

Immutably borrows from an owned value. Read more

Mutably borrows from an owned value. Read more

Returns the argument unchanged.

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

The alignment of pointer.

The type for initializers.

Initializes a with the given initializer. Read more

Dereferences the given pointer. Read more

Mutably dereferences the given pointer. Read more

Drops the object pointed to by the given pointer. Read more

Should always be Self

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

Checks if self is actually part of its subset T (and can be converted to it).

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

The inclusion map: converts self to the equivalent element of its superset.

The inverse inclusion map: attempts to construct self from the equivalent element of its superset. Read more

Checks if self is actually part of its subset T (and can be converted to it).

Use with care! Same as self.to_subset but without any property checks. Always succeeds.

The inclusion map: converts self to the equivalent element of its superset.

The resulting type after obtaining ownership.

Creates owned data from borrowed data, usually by cloning. Read more

🔬 This is a nightly-only experimental API. (toowned_clone_into)

Uses borrowed data to replace owned data, usually by cloning. Read more

The type returned in the event of a conversion error.

Performs the conversion.

The type returned in the event of a conversion error.

Performs the conversion.