Struct Problem 

pub struct Problem {
    pub depot: Coord,
    pub stops: Vec<Stop>,
    pub vehicles: Vec<Vehicle>,
    pub depot_window: Option<TimeWindow>,
}

A capacitated VRP instance: one depot, a set of stops, a fleet.

Fields

depot: Coord

stops: Vec<Stop>

vehicles: Vec<Vehicle>

depot_window: Option<TimeWindow>

Optional depot operating window. Its end is the latest time a vehicle may return to the depot; start is when vehicles may leave. None means the depot imposes no temporal bound (pure CVRP behaviour).

Implementations

impl Problem

pub fn location_count(&self) -> usize

Number of locations including the depot (stops.len() + 1).

pub fn coords(&self) -> Vec<Coord>

All coordinates indexed by LocationId: depot first, then stops.

pub fn depot_open(&self) -> f64

Earliest time a vehicle may leave the depot (0 if unconstrained).

pub fn depot_due(&self) -> f64

Latest time a vehicle may return to the depot (+∞ if unconstrained).

Trait Implementations

impl Clone for Problem

fn clone(&self) -> Problem

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Problem

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

Formats the value using the given formatter.

impl PartialEq for Problem

fn eq(&self, other: &Problem) -> 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 Problem