Struct soco::problem::SmoothedLoadOptimization
source · [−]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
sourceimpl<'a, T> SmoothedLoadOptimization<T> where
T: Value<'a>,
impl<'a, T> SmoothedLoadOptimization<T> where
T: Value<'a>,
sourcepub fn into_sblo(self) -> SmoothedBalancedLoadOptimization<'a, T>
pub fn into_sblo(self) -> SmoothedBalancedLoadOptimization<'a, T>
Convert instance to an instance of Smoothed Balanced-Load Optimization.
Trait Implementations
sourceimpl<'a, T> BaseProblem for SmoothedLoadOptimization<T> where
T: Value<'a>,
impl<'a, T> BaseProblem for SmoothedLoadOptimization<T> where
T: Value<'a>,
sourceimpl<T: Clone> Clone for SmoothedLoadOptimization<T>
impl<T: Clone> Clone for SmoothedLoadOptimization<T>
sourcefn clone(&self) -> SmoothedLoadOptimization<T>
fn clone(&self) -> SmoothedLoadOptimization<T>
Returns a copy of the value. Read more
1.0.0 · sourcefn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from source
. Read more
sourceimpl<T: Debug> Debug for SmoothedLoadOptimization<T>
impl<T: Debug> Debug for SmoothedLoadOptimization<T>
sourceimpl DefaultGivenOnlineProblem<i32, SmoothedLoadOptimization<i32>, (), DataCenterModelOutputFailure> for Memory
impl DefaultGivenOnlineProblem<i32, SmoothedLoadOptimization<i32>, (), DataCenterModelOutputFailure> for Memory
fn default(o: &Online<IntegralSmoothedLoadOptimization>) -> Self
sourceimpl<'a, T> Model<T, SmoothedLoadOptimization<T>, DataCenterOfflineInput, DataCenterOnlineInput, (), DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
impl<'a, T> Model<T, SmoothedLoadOptimization<T>, DataCenterOfflineInput, DataCenterOnlineInput, (), DataCenterModelOutputFailure> for DataCenterModel where
T: Value<'a>,
sourcefn to(&self, _: DataCenterOfflineInput) -> SmoothedLoadOptimization<T>
fn to(&self, _: DataCenterOfflineInput) -> SmoothedLoadOptimization<T>
Notes:
- Only allows for a single location, source, and job type.
- Assumes full utilization and averages the energy cost over the time horizon.
sourcefn update(
&self,
o: &mut Online<SmoothedLoadOptimization<T>>,
_: DataCenterOnlineInput
)
fn update(
&self,
o: &mut Online<SmoothedLoadOptimization<T>>,
_: DataCenterOnlineInput
)
Performs an online update of the given problem instance $o$ with some $input$ (which may be uncertain).
sourceimpl<'a, T> Problem<T, (), DataCenterModelOutputFailure> for SmoothedLoadOptimization<T> where
T: Value<'a>,
impl<'a, T> Problem<T, (), DataCenterModelOutputFailure> for SmoothedLoadOptimization<T> where
T: Value<'a>,
sourcefn hit_cost(
&self,
t: i32,
x: Config<T>
) -> Cost<(), DataCenterModelOutputFailure>
fn hit_cost(
&self,
t: i32,
x: Config<T>
) -> Cost<(), DataCenterModelOutputFailure>
Hitting cost.
sourcefn objective_function<'a>(&self, xs: &Schedule<T>) -> Result<Cost<C, D>> where
T: Value<'a>,
fn objective_function<'a>(&self, xs: &Schedule<T>) -> Result<Cost<C, D>> where
T: Value<'a>,
Objective function. Calculates the cost of a schedule.
sourcefn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn inverted_objective_function<'a>(
&self,
xs: &Schedule<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
Inverted Objective function. Calculates the cost of a schedule. Pays the switching cost for powering down rather than powering up. Read more
sourcefn alpha_unfair_objective_function<'a>(
&self,
xs: &Schedule<T>,
alpha: f64
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn alpha_unfair_objective_function<'a>(
&self,
xs: &Schedule<T>,
alpha: f64
) -> Result<Cost<C, D>> where
T: Value<'a>,
$\alpha$-unfair Objective function. Calculates the cost of a schedule.
sourcefn objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
fn objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>
) -> Result<Cost<C, D>> where
T: Value<'a>,
Objective function starting from an initial configuration other than $\mathbf{0}$.
fn _objective_function_with_default<'a>(
&self,
xs: &Schedule<T>,
default: &Config<T>,
alpha: f64,
inverted: bool,
t_end: i32
) -> Result<Cost<C, D>> where
T: Value<'a>,
sourcefn total_movement<'a>(&self, xs: &Schedule<T>, inverted: bool) -> Result<N64> where
T: Value<'a>,
fn total_movement<'a>(&self, xs: &Schedule<T>, inverted: bool) -> Result<N64> where
T: Value<'a>,
Movement in the decision space.
fn _default_config<'a>(&self) -> Config<T> where
T: Value<'a>,
sourceimpl<'a, T> VerifiableProblem for SmoothedLoadOptimization<T> where
T: Value<'a>,
impl<'a, T> VerifiableProblem for SmoothedLoadOptimization<T> where
T: Value<'a>,
Auto Trait Implementations
impl<T> RefUnwindSafe for SmoothedLoadOptimization<T> where
T: RefUnwindSafe,
impl<T> Send for SmoothedLoadOptimization<T> where
T: Send,
impl<T> Sync for SmoothedLoadOptimization<T> where
T: Sync,
impl<T> Unpin for SmoothedLoadOptimization<T> where
T: Unpin,
impl<T> UnwindSafe for SmoothedLoadOptimization<T> where
T: UnwindSafe,
Blanket Implementations
sourceimpl<T> BorrowMut<T> for T where
T: ?Sized,
impl<T> BorrowMut<T> for T where
T: ?Sized,
const: unstable · sourcefn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<T> Pointable for T
impl<T> Pointable for T
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
impl<SS, SP> SupersetOf<SS> for SP where
SS: SubsetOf<SP>,
fn to_subset(&self) -> Option<SS>
fn to_subset(&self) -> Option<SS>
The inverse inclusion map: attempts to construct self
from the equivalent element of its
superset. Read more
fn is_in_subset(&self) -> bool
fn is_in_subset(&self) -> bool
Checks if self
is actually part of its subset T
(and can be converted to it).
fn to_subset_unchecked(&self) -> SS
fn to_subset_unchecked(&self) -> SS
Use with care! Same as self.to_subset
but without any property checks. Always succeeds.
fn from_subset(element: &SS) -> SP
fn from_subset(element: &SS) -> SP
The inclusion map: converts self
to the equivalent element of its superset.
sourceimpl<T> ToOwned for T where
T: Clone,
impl<T> ToOwned for T where
T: Clone,
type Owned = T
type Owned = T
The resulting type after obtaining ownership.
sourcefn clone_into(&self, target: &mut T)
fn clone_into(&self, target: &mut T)
toowned_clone_into
)Uses borrowed data to replace owned data, usually by cloning. Read more