Skip to main content

SubstationSiting

Struct SubstationSiting 

Source
pub struct SubstationSiting {
    pub load_points: Vec<(f64, f64, f64)>,
    pub n_substations: usize,
    pub voltage_kv: f64,
    pub cable_cost_million_eur_per_km: f64,
}
Expand description

Geographic substation siting via load-weighted k-means clustering.

Each cluster centroid represents an optimal substation location that minimises the total weighted distance (≈ cable length) to served load points.

Fields§

§load_points: Vec<(f64, f64, f64)>

Load points: (x_km, y_km, load_mw).

§n_substations: usize

Desired number of substations.

§voltage_kv: f64

Nominal voltage of the distribution feeder [kV].

§cable_cost_million_eur_per_km: f64

Cable cost per km [million EUR/km].

Implementations§

Source§

impl SubstationSiting

Source

pub fn new( load_points: Vec<(f64, f64, f64)>, n_substations: usize, voltage_kv: f64, cable_cost_million_eur_per_km: f64, ) -> Self

Construct a new siting problem.

Source

pub fn optimize_kmeans( &self, max_iter: usize, ) -> Result<SitingResult, OxiGridError>

Optimise substation locations using load-weighted k-means.

Initialisation: spread substations by percentile of x-coordinate, choosing the load-weighted centroid within each segment as the initial centre.

Iteration: assign each load point to its nearest substation (Euclidean), recompute load-weighted centroids. Converge when centroid shift < 0.01 km.

Source

pub fn euclidean_distance(p1: (f64, f64), p2: (f64, f64)) -> f64

Euclidean distance between two 2D points.

Source

pub fn load_weighted_centroid(points: &[(f64, f64, f64)]) -> (f64, f64)

Load-weighted centroid of a set of (x, y, load_mw) points.

Returns the unweighted centroid if total load is zero.

Auto Trait Implementations§

Blanket Implementations§

Source§

impl<T> Any for T
where T: 'static + ?Sized,

Source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
Source§

impl<T> Borrow<T> for T
where T: ?Sized,

Source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
Source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

Source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
Source§

impl<T> From<T> for T

Source§

fn from(t: T) -> T

Returns the argument unchanged.

Source§

impl<T, U> Into<U> for T
where U: From<T>,

Source§

fn into(self) -> U

Calls U::from(self).

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

Source§

impl<T> IntoEither for T

Source§

fn into_either(self, into_left: bool) -> Either<Self, Self>

Converts self into a Left variant of Either<Self, Self> if into_left is true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

fn into_either_with<F>(self, into_left: F) -> Either<Self, Self>
where F: FnOnce(&Self) -> bool,

Converts self into a Left variant of Either<Self, Self> if into_left(&self) returns true. Converts self into a Right variant of Either<Self, Self> otherwise. Read more
Source§

impl<T> Pointable for T

Source§

const ALIGN: usize

The alignment of pointer.
Source§

type Init = T

The type for initializers.
Source§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
Source§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
Source§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
Source§

unsafe fn drop(ptr: usize)

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

impl<T> Same for T

Source§

type Output = T

Should always be Self
Source§

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

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

fn is_in_subset(&self) -> bool

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

unsafe fn to_subset_unchecked(&self) -> SS

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

fn from_subset(element: &SS) -> SP

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

impl<SS, SP> SupersetOf<SS> for SP
where SS: SubsetOf<SP>,

Source§

fn to_subset(&self) -> Option<SS>

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

fn is_in_subset(&self) -> bool

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

fn to_subset_unchecked(&self) -> SS

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

fn from_subset(element: &SS) -> SP

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

impl<T, U> TryFrom<U> for T
where U: Into<T>,

Source§

type Error = Infallible

The type returned in the event of a conversion error.
Source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
Source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

Source§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
Source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.