Skip to main content

EtdDispatch

Struct EtdDispatch 

Source
pub struct EtdDispatch {
    pub wait_weight: f64,
    pub delay_weight: f64,
    pub door_weight: f64,
}
Expand description

Estimated Time to Destination (ETD) dispatch algorithm.

Industry-standard algorithm for modern elevator systems. For each pending call, evaluates every elevator and assigns the one that minimizes total cost: (time to serve the new rider) + (delay imposed on all existing riders) + (door/loading overhead).

§Cost model

cost = wait_weight * travel_time + delay_weight * existing_rider_delay + door_weight * estimated_door_overhead + direction_bonus

Rider delay is computed from actual route destinations of riders currently aboard each elevator.

Fields§

§wait_weight: f64

Weight for travel time to reach the calling stop.

§delay_weight: f64

Weight for delay imposed on existing riders.

§door_weight: f64

Weight for door open/close overhead at intermediate stops.

Implementations§

Source§

impl EtdDispatch

Source

pub const fn new() -> Self

Create a new EtdDispatch with default weights.

Defaults: wait_weight = 1.0, delay_weight = 1.0, door_weight = 0.5.

Source

pub const fn with_delay_weight(delay_weight: f64) -> Self

Create with a single delay weight (backwards-compatible shorthand).

Sets wait_weight = 1.0 and door_weight = 0.5.

Source

pub const fn with_weights( wait_weight: f64, delay_weight: f64, door_weight: f64, ) -> Self

Create with fully custom weights.

Trait Implementations§

Source§

impl Default for EtdDispatch

Source§

fn default() -> Self

Returns the “default value” for a type. Read more
Source§

impl DispatchStrategy for EtdDispatch

Source§

fn decide( &mut self, _elevator: EntityId, _elevator_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, ) -> DispatchDecision

Decide for a single elevator.
Source§

fn decide_all( &mut self, elevators: &[(EntityId, f64)], group: &ElevatorGroup, manifest: &DispatchManifest, world: &World, ) -> Vec<(EntityId, DispatchDecision)>

Decide for all idle elevators in a group. Default: calls decide() per elevator.
Source§

fn notify_removed(&mut self, _elevator: EntityId)

Notify the strategy that an elevator has been removed. Read more

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, 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.