Struct Objective 

pub struct Objective {
    pub distance: f64,
    pub vehicles: f64,
    pub time: f64,
}

Weights of the linear objective cost = w_d·distance + w_v·vehicles + w_t·time.

The default is pure distance minimisation (distance = 1, the rest 0), which is what the classic VRPTW benchmarks score against.

Fields

distance: f64

Weight on total travelled distance.

vehicles: f64

Weight on the number of vehicles (routes) used.

time: f64

Weight on total elapsed time (travel + wait + service).

Implementations

impl Objective

pub fn distance_only() -> Self

Minimise total distance only.

pub fn score( &self, total_distance: f64, route_count: usize, total_time: f64, ) -> f64

Score from already rolled-up totals. Kept separate from Self::of so the search loop can score incrementally without owning a Solution.

pub fn of(&self, solution: &Solution) -> f64

Score a complete Solution.

Trait Implementations

impl Clone for Objective

fn clone(&self) -> Objective

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Copy for Objective

impl Debug for Objective

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl Default for Objective

fn default() -> Self

Returns the “default value” for a type.

impl PartialEq for Objective

fn eq(&self, other: &Objective) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl StructuralPartialEq for Objective