Struct RsrDispatch 

pub struct RsrDispatch {
    pub eta_weight: f64,
    pub wrong_direction_penalty: f64,
    pub coincident_car_call_bonus: f64,
    pub load_penalty_coeff: f64,
}

Additive RSR-style cost stack. Lower scores win the Hungarian assignment.

See module docs for the cost shape. All weights default to 0.0 except eta_weight (1.0), giving a baseline that mirrors NearestCarDispatch until terms are opted in.

Weight invariants

Every weight field must be finite and non-negative. The with_* builder methods enforce this with assert!; direct field mutation bypasses the check and is a caller responsibility. A NaN weight propagates through the multiply-add chain and silently collapses every pair’s cost to zero (Rust’s NaN.max(0.0) == 0.0), producing an arbitrary but type-valid assignment from the Hungarian solver — a hard bug to diagnose.

Fields

eta_weight: f64

Weight on travel_time = distance / max_speed (seconds). Default 1.0; raising it shifts the blend toward travel time.

wrong_direction_penalty: f64

Constant added when the candidate stop lies opposite the car’s committed travel direction.

Default 0.0; the Otis RSR lineage uses a large value so any right-direction candidate outranks any wrong-direction one. Ignored for cars in ElevatorPhase::Idle or stopped phases, since an idle car has no committed direction to be opposite to.

coincident_car_call_bonus: f64

Bonus subtracted when the candidate stop is already a car-call inside this car.

Merges the new pickup with an existing dropoff instead of spawning an unrelated trip. Default 0.0. Read from DispatchManifest::car_calls_for.

load_penalty_coeff: f64

Coefficient on a smooth load-fraction penalty (load_penalty_coeff · load_ratio).

Fires for partially loaded cars below the bypass_load_*_pct threshold enforced by pair_can_do_work; lets you prefer emptier cars for new pickups without an on/off cliff. Default 0.0.

Implementations

impl RsrDispatch

pub const fn new() -> Self

Create a new RsrDispatch with the baseline weights (eta_weight = 1.0, all penalties/bonuses disabled).

pub fn with_wrong_direction_penalty(self, weight: f64) -> Self

Set the wrong-direction penalty.

Panics

Panics on non-finite or negative weights — a negative penalty would invert the direction ordering, silently preferring wrong-direction candidates.

pub fn with_coincident_car_call_bonus(self, weight: f64) -> Self

Set the coincident-car-call bonus.

Panics

Panics on non-finite or negative weights — the bonus is subtracted, so a negative value would become a penalty.

pub fn with_load_penalty_coeff(self, weight: f64) -> Self

Set the load-penalty coefficient.

Panics

Panics on non-finite or negative weights.

pub fn with_eta_weight(self, weight: f64) -> Self

Set the ETA weight.

Panics

Panics on non-finite or negative weights. Zero is allowed and reduces the strategy to penalty/bonus tiebreaking alone.

Trait Implementations

impl Default for RsrDispatch

fn default() -> Self

Returns the “default value” for a type.

impl DispatchStrategy for RsrDispatch

fn rank(&mut self, ctx: &RankContext<'_>) -> Option<f64>

Score the cost of sending car to stop. Lower is better.

fn pre_dispatch( &mut self, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &mut World, )

Optional hook called once per group before the assignment pass.

fn prepare_car( &mut self, _car: EntityId, _car_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, )

Optional hook called once per candidate car, before any rank calls for that car in the current pass.

fn fallback( &mut self, _car: EntityId, _car_position: f64, _group: &ElevatorGroup, _manifest: &DispatchManifest, _world: &World, ) -> DispatchDecision

Decide what an idle car should do when no stop was assigned to it.

fn notify_removed(&mut self, _elevator: EntityId)

Notify the strategy that an elevator has been removed.