Struct NearestNeighborSuggestor 

pub struct NearestNeighborSuggestor;

Routes a vehicle via Nearest-Neighbour heuristic with time-window feasibility check.

Algorithm: O(n²) — at each stop, visit the nearest unvisited customer whose time window is still reachable. Backtracks to depot when no further customer is reachable.

Confidence: capped at 0.60 — nearest-neighbour can be 20-25% worse than optimal on real instances.

Trait Implementations

impl Suggestor for NearestNeighborSuggestor

fn name(&self) -> &str

Human-readable name, used for logging and provenance.

fn dependencies(&self) -> &[ContextKey]

Context keys this suggestor reads from.

fn complexity_hint(&self) -> Option<&'static str>

Algorithmic complexity of this suggestor’s core computation.

fn accepts(&self, ctx: &dyn Context) -> bool

Pure predicate: should this suggestor execute given the current context?

fn execute<'life0, 'life1, 'async_trait>( &'life0 self, ctx: &'life1 dyn Context, ) -> Pin<Box<dyn Future<Output = AgentEffect> + Send + 'async_trait>>

where Self: 'async_trait, 'life0: 'async_trait, 'life1: 'async_trait,

Produce effects given the current context.