🥮 mooncakes.io

    pqx123-lgtm/moonbit-vrp-solver/core does not have a README file

    RouteEncodingError

    source
    pub(all) suberror RouteEncodingError {
      EmptyRoute
      InvalidCustomerId(String)
      UnknownCustomerId(Int)
      DuplicateCustomerId(Int)
    } derive(Eq, ToJson, 
    Debug    )

    Checked errors for the compact route exchange format.

    CandidateInsertion

    source
    pub struct CandidateInsertion {
      route_index : Int
      position : Int
      objective : Double
      solution : Solution
    } derive(ToJson, 
    Debug    )

    CandidateInsertion::objective

    source
    fn CandidateInsertion::objective(self : CandidateInsertion) -> Double

    CandidateInsertion::position

    source
    fn CandidateInsertion::position(self : CandidateInsertion) -> Int

    CandidateInsertion::result

    source

    CandidateInsertion::route_index

    source
    fn CandidateInsertion::route_index(self : CandidateInsertion) -> Int

    ConstraintSummary

    source
    pub struct ConstraintSummary {
      route_count : Int
      assigned_count : Int
      unassigned_count : Int
      total_distance : Double
      total_duration : Double
      total_waiting : Double
      total_load : Double
      capacity_utilization : Double
      maximum_lateness : Double
      feasible : Bool
    } derive(ToJson, 
    Debug    )

    Aggregated route and assignment metrics suitable for dashboards and reports.

    ConstraintSummary::assigned_count

    source
    fn ConstraintSummary::assigned_count(self : ConstraintSummary) -> Int

    ConstraintSummary::capacity_utilization

    source
    fn ConstraintSummary::capacity_utilization(self : ConstraintSummary) -> Double

    ConstraintSummary::is_feasible

    source
    fn ConstraintSummary::is_feasible(self : ConstraintSummary) -> Bool

    ConstraintSummary::maximum_lateness

    source
    fn ConstraintSummary::maximum_lateness(self : ConstraintSummary) -> Double

    ConstraintSummary::route_count

    source
    fn ConstraintSummary::route_count(self : ConstraintSummary) -> Int

    ConstraintSummary::total_distance

    source
    fn ConstraintSummary::total_distance(self : ConstraintSummary) -> Double

    ConstraintSummary::total_duration

    source
    fn ConstraintSummary::total_duration(self : ConstraintSummary) -> Double

    ConstraintSummary::total_load

    source
    fn ConstraintSummary::total_load(self : ConstraintSummary) -> Double

    ConstraintSummary::total_waiting

    source
    fn ConstraintSummary::total_waiting(self : ConstraintSummary) -> Double

    ConstraintSummary::unassigned_count

    source
    fn ConstraintSummary::unassigned_count(self : ConstraintSummary) -> Int

    ConstraintSummary::unserved_ratio

    source
    fn ConstraintSummary::unserved_ratio(self : ConstraintSummary, instance : VrpInstance) -> Double

    CostBreakdown

    source
    pub struct CostBreakdown {
      distance : Double
      capacity_penalty : Double
      time_penalty : Double
      duration_penalty : Double
      unassigned_penalty : Double
      objective : Double
    } derive(ToJson, 
    Debug    )

    CostBreakdown::capacity_penalty

    source
    fn CostBreakdown::capacity_penalty(self : CostBreakdown) -> Double

    CostBreakdown::distance

    source
    fn CostBreakdown::distance(self : CostBreakdown) -> Double

    CostBreakdown::duration_penalty

    source
    fn CostBreakdown::duration_penalty(self : CostBreakdown) -> Double

    CostBreakdown::objective

    source
    fn CostBreakdown::objective(self : CostBreakdown) -> Double

    CostBreakdown::penalty_total

    source
    fn CostBreakdown::penalty_total(self : CostBreakdown) -> Double

    CostBreakdown::time_penalty

    source
    fn CostBreakdown::time_penalty(self : CostBreakdown) -> Double

    CostBreakdown::unassigned_penalty

    source
    fn CostBreakdown::unassigned_penalty(self : CostBreakdown) -> Double

    Customer

    source
    pub struct Customer {
      external_id : Int
      x : Double
      y : Double
      demand : Double
      ready_time : Double
      due_time : Double
      service_time : Double
    } derive(ToJson, 
    Debug    )

    Customer::coordinates

    source
    fn Customer::coordinates(self : Customer) -> (Double, Double)

    Customer::demand

    source
    fn Customer::demand(self : Customer) -> Double

    Customer::due_time

    source
    fn Customer::due_time(self : Customer) -> Double

    Customer::external_id

    source
    fn Customer::external_id(self : Customer) -> Int

    Customer::new

    source
    fn Customer::new(external_id : Int, x : Double, y : Double, demand : Double, ready_time? : Double, due_time? : Double, service_time? : Double) -> Customer

    Customer::ready_time

    source
    fn Customer::ready_time(self : Customer) -> Double

    Customer::service_time

    source
    fn Customer::service_time(self : Customer) -> Double

    Customer::window_width

    source
    fn Customer::window_width(self : Customer) -> Double

    Customer::x_coord

    source
    fn Customer::x_coord(self : Customer) -> Double

    Customer::y_coord

    source
    fn Customer::y_coord(self : Customer) -> Double

    Depot

    source
    pub struct Depot {
      x : Double
      y : Double
      ready_time : Double
      due_time : Double
    } derive(ToJson, 
    Debug    )

    Depot::coordinates

    source
    fn Depot::coordinates(self : Depot) -> (Double, Double)

    Depot::due_time

    source
    fn Depot::due_time(self : Depot) -> Double

    Depot::new

    source
    fn Depot::new(x : Double, y : Double, ready_time? : Double, due_time? : Double) -> Depot

    Depot::ready_time

    source
    fn Depot::ready_time(self : Depot) -> Double

    Depot::x_coord

    source
    fn Depot::x_coord(self : Depot) -> Double

    Coordinate accessors keep the record representation private while making the public API usable from other packages.

    Depot::y_coord

    source
    fn Depot::y_coord(self : Depot) -> Double

    DestroyOperator

    source
    pub(all) enum DestroyOperator {
      Random
      Shaw
      Worst
      Route
      Cluster
      TimeCritical
    } derive(Eq, ToJson, 
    Debug    )

    DistanceMetric

    source
    pub(all) enum DistanceMetric {
      Euclidean
      RoundedEuclidean
      Manhattan
      Chebyshev
    } derive(Eq, ToJson, 
    Debug    )

    Distance functions supported by the instance builder.

    DistanceMetric::description

    source
    fn DistanceMetric::description(self : DistanceMetric) -> String

    DistanceMetric::distance

    source
    fn DistanceMetric::distance(self : DistanceMetric, ax : Double, ay : Double, bx : Double, by : Double) -> Double

    Computes the distance between two points under this metric.

    DistanceMetric::is_symmetric

    source
    fn DistanceMetric::is_symmetric(self : DistanceMetric) -> Bool

    All built-in metrics are symmetric and satisfy d(a, a) = 0.

    DistanceMetric::name

    source
    fn DistanceMetric::name(self : DistanceMetric) -> String

    Returns the conventional name used by benchmark formats.

    FeasibilityAssessment

    source
    pub struct FeasibilityAssessment {
      feasible : Bool
      capacity_violation : Double
      time_violation : Double
      duration_violation : Double
      unassigned_count : Int
      route_count : Int
      validation : ValidationReport
    } derive(ToJson, 
    Debug    )

    FeasibilityAssessment::capacity_violation

    source
    fn FeasibilityAssessment::capacity_violation(self : FeasibilityAssessment) -> Double

    FeasibilityAssessment::duration_violation

    source
    fn FeasibilityAssessment::duration_violation(self : FeasibilityAssessment) -> Double

    FeasibilityAssessment::is_feasible

    source
    fn FeasibilityAssessment::is_feasible(self : FeasibilityAssessment) -> Bool

    FeasibilityAssessment::route_count

    source
    fn FeasibilityAssessment::route_count(self : FeasibilityAssessment) -> Int

    FeasibilityAssessment::time_violation

    source
    fn FeasibilityAssessment::time_violation(self : FeasibilityAssessment) -> Double

    FeasibilityAssessment::unassigned_count

    source
    fn FeasibilityAssessment::unassigned_count(self : FeasibilityAssessment) -> Int

    FeasibilityAssessment::validation

    source

    FeasibilityPolicy

    source
    pub struct FeasibilityPolicy {
      capacity_tolerance : Double
      time_tolerance : Double
      duration_tolerance : Double
      max_unassigned : Int
    } derive(ToJson, 
    Debug    )

    Numerical policy used by integrations that need explicit tolerances.

    FeasibilityPolicy::capacity_tolerance

    source
    fn FeasibilityPolicy::capacity_tolerance(self : FeasibilityPolicy) -> Double

    FeasibilityPolicy::default

    source

    FeasibilityPolicy::duration_tolerance

    source
    fn FeasibilityPolicy::duration_tolerance(self : FeasibilityPolicy) -> Double

    FeasibilityPolicy::max_unassigned

    source
    fn FeasibilityPolicy::max_unassigned(self : FeasibilityPolicy) -> Int

    FeasibilityPolicy::time_tolerance

    source
    fn FeasibilityPolicy::time_tolerance(self : FeasibilityPolicy) -> Double

    FeasibilityPolicy::tune

    source
    fn FeasibilityPolicy::tune(self : FeasibilityPolicy, capacity_tolerance? : Double, time_tolerance? : Double, duration_tolerance? : Double, max_unassigned? : Int) -> FeasibilityPolicy

    InstanceStatistics

    source
    pub struct InstanceStatistics {
      customer_count : Int
      total_demand : Double
      average_demand : Double
      maximum_demand : Double
      minimum_demand : Double
      demand_capacity_ratio : Double
      fleet_size : Int
      average_nearest_neighbor : Double
      average_depot_distance : Double
      time_windowed_customers : Int
    } derive(ToJson, 
    Debug    )

    Structural statistics used to select a heuristic and explain a benchmark.

    InstanceStatistics::average_demand

    source
    fn InstanceStatistics::average_demand(self : InstanceStatistics) -> Double

    InstanceStatistics::average_depot_distance

    source
    fn InstanceStatistics::average_depot_distance(self : InstanceStatistics) -> Double

    InstanceStatistics::average_nearest_neighbor

    source
    fn InstanceStatistics::average_nearest_neighbor(self : InstanceStatistics) -> Double

    InstanceStatistics::customer_count

    source
    fn InstanceStatistics::customer_count(self : InstanceStatistics) -> Int

    InstanceStatistics::demand_capacity_ratio

    source
    fn InstanceStatistics::demand_capacity_ratio(self : InstanceStatistics) -> Double

    InstanceStatistics::fleet_size

    source
    fn InstanceStatistics::fleet_size(self : InstanceStatistics) -> Int

    InstanceStatistics::maximum_demand

    source
    fn InstanceStatistics::maximum_demand(self : InstanceStatistics) -> Double

    InstanceStatistics::minimum_demand

    source
    fn InstanceStatistics::minimum_demand(self : InstanceStatistics) -> Double

    InstanceStatistics::time_windowed_customers

    source
    fn InstanceStatistics::time_windowed_customers(self : InstanceStatistics) -> Int

    InstanceStatistics::total_demand

    source
    fn InstanceStatistics::total_demand(self : InstanceStatistics) -> Double

    ProblemVariant

    source
    pub(all) enum ProblemVariant {
      CVRP
      VRPTW
    } derive(Eq, ToJson, 
    Debug    )

    ProblemVariant::description

    source
    fn ProblemVariant::description(self : ProblemVariant) -> String

    Returns a user-facing description of a problem variant.

    ProblemVariant::name

    source
    fn ProblemVariant::name(self : ProblemVariant) -> String

    RepairOperator

    source
    pub(all) enum RepairOperator {
      Greedy
      Regret2
      DemandFirst
      TimeWindow
    } derive(Eq, ToJson, 
    Debug    )

    RouteMetrics

    source
    pub struct RouteMetrics {
      distance : Double
      duration : Double
      waiting_time : Double
      load : Double
      capacity_violation : Double
      time_violation : Double
      duration_violation : Double
      feasible : Bool
      arrivals : Array[Double]
    } derive(ToJson, 
    Debug    )

    RouteMetrics::arrivals

    source
    fn RouteMetrics::arrivals(self : RouteMetrics) -> Array[Double]

    RouteMetrics::capacity_violation

    source
    fn RouteMetrics::capacity_violation(self : RouteMetrics) -> Double

    RouteMetrics::distance

    source
    fn RouteMetrics::distance(self : RouteMetrics) -> Double

    RouteMetrics::duration

    source
    fn RouteMetrics::duration(self : RouteMetrics) -> Double

    RouteMetrics::duration_violation

    source
    fn RouteMetrics::duration_violation(self : RouteMetrics) -> Double

    RouteMetrics::has_violation

    source
    fn RouteMetrics::has_violation(self : RouteMetrics) -> Bool

    RouteMetrics::is_feasible

    source
    fn RouteMetrics::is_feasible(self : RouteMetrics) -> Bool

    RouteMetrics::load

    source
    fn RouteMetrics::load(self : RouteMetrics) -> Double

    RouteMetrics::time_violation

    source
    fn RouteMetrics::time_violation(self : RouteMetrics) -> Double

    RouteMetrics::total_violation

    source
    fn RouteMetrics::total_violation(self : RouteMetrics) -> Double

    RouteMetrics::waiting_time

    source
    fn RouteMetrics::waiting_time(self : RouteMetrics) -> Double

    RoutePlan

    source
    pub struct RoutePlan {
      stops : Array[Int]
      metrics : RouteMetrics
    } derive(ToJson, 
    Debug    )

    RoutePlan::contains

    source
    fn RoutePlan::contains(self : RoutePlan, customer_index : Int) -> Bool

    RoutePlan::customer_indices

    source
    fn RoutePlan::customer_indices(self : RoutePlan) -> Array[Int]

    RoutePlan::distance

    source
    fn RoutePlan::distance(self : RoutePlan) -> Double

    RoutePlan::duration

    source
    fn RoutePlan::duration(self : RoutePlan) -> Double

    RoutePlan::first_customer

    source
    fn RoutePlan::first_customer(self : RoutePlan) -> Int?

    RoutePlan::is_feasible

    source
    fn RoutePlan::is_feasible(self : RoutePlan) -> Bool

    RoutePlan::last_customer

    source
    fn RoutePlan::last_customer(self : RoutePlan) -> Int?

    RoutePlan::load

    source
    fn RoutePlan::load(self : RoutePlan) -> Double

    RoutePlan::metrics

    source
    fn RoutePlan::metrics(self : RoutePlan) -> RouteMetrics

    RoutePlan::stop_at

    source
    fn RoutePlan::stop_at(self : RoutePlan, position : Int) -> Int?

    RoutePlan::stop_count

    source
    fn RoutePlan::stop_count(self : RoutePlan) -> Int

    RoutePlan::stops

    source
    fn RoutePlan::stops(self : RoutePlan) -> Array[Int]

    RouteProfile

    source
    pub struct RouteProfile {
      stop_count : Int
      load_ratio : Double
      distance : Double
      duration : Double
      waiting : Double
      lateness : Double
      slack : Double
      feasible : Bool
    } derive(ToJson, 
    Debug    )

    A normalized view of one route's resource consumption.

    RouteProfile::distance

    source
    fn RouteProfile::distance(self : RouteProfile) -> Double

    RouteProfile::duration

    source
    fn RouteProfile::duration(self : RouteProfile) -> Double

    RouteProfile::is_feasible

    source
    fn RouteProfile::is_feasible(self : RouteProfile) -> Bool

    RouteProfile::lateness

    source
    fn RouteProfile::lateness(self : RouteProfile) -> Double

    RouteProfile::load_ratio

    source
    fn RouteProfile::load_ratio(self : RouteProfile) -> Double

    RouteProfile::slack

    source
    fn RouteProfile::slack(self : RouteProfile) -> Double

    RouteProfile::stop_count

    source
    fn RouteProfile::stop_count(self : RouteProfile) -> Int

    RouteProfile::waiting

    source
    fn RouteProfile::waiting(self : RouteProfile) -> Double

    Solution

    source
    pub struct Solution {
      routes : Array[RoutePlan]
      unassigned : Array[Int]
      total_distance : Double
      objective : Double
      feasible : Bool
      total_capacity_violation : Double
      total_time_violation : Double
      total_duration_violation : Double
    } derive(ToJson, 
    Debug    )

    Solution::assigned_customers

    source
    fn Solution::assigned_customers(self : Solution) -> Array[Int]

    Solution::completion_ratio

    source
    fn Solution::completion_ratio(self : Solution, instance : VrpInstance) -> Double

    Solution::constraint_summary

    source
    fn Solution::constraint_summary(self : Solution, instance : VrpInstance) -> ConstraintSummary

    Solution::copy

    source
    fn Solution::copy(self : Solution) -> Solution

    Solution::cost_breakdown

    source
    fn Solution::cost_breakdown(self : Solution, config : SolveConfig) -> CostBreakdown

    Explains the penalized objective without exposing the private formula.

    Solution::customer_labels

    source
    fn Solution::customer_labels(self : Solution, instance : VrpInstance) -> Array[Array[Int]]

    Solution::is_complete

    source
    fn Solution::is_complete(self : Solution, instance : VrpInstance) -> Bool

    Solution::is_feasible

    source
    fn Solution::is_feasible(self : Solution) -> Bool

    Solution::is_valid_for

    source
    fn Solution::is_valid_for(self : Solution, instance : VrpInstance, policy : FeasibilityPolicy) -> Bool

    Solution::max_capacity_violation

    source
    fn Solution::max_capacity_violation(self : Solution) -> Double

    Solution::max_time_violation

    source
    fn Solution::max_time_violation(self : Solution) -> Double

    Solution::objective_value

    source
    fn Solution::objective_value(self : Solution) -> Double

    Solution::route_at

    source
    fn Solution::route_at(self : Solution, index : Int) -> RoutePlan?

    Solution::route_count

    source
    fn Solution::route_count(self : Solution) -> Int

    Solution::route_distances

    source
    fn Solution::route_distances(self : Solution) -> Array[Double]

    Solution::route_durations

    source
    fn Solution::route_durations(self : Solution) -> Array[Double]

    Solution::route_loads

    source
    fn Solution::route_loads(self : Solution) -> Array[Double]

    Solution::route_profiles

    source
    fn Solution::route_profiles(self : Solution, instance : VrpInstance) -> Array[RouteProfile]

    Solution::route_stops

    source
    fn Solution::route_stops(self : Solution) -> Array[Array[Int]]

    Solution::routes

    source
    fn Solution::routes(self : Solution) -> Array[RoutePlan]

    Solution::total_capacity_violation

    source
    fn Solution::total_capacity_violation(self : Solution) -> Double

    Solution::total_distance

    source
    fn Solution::total_distance(self : Solution) -> Double

    Solution::total_duration_violation

    source
    fn Solution::total_duration_violation(self : Solution) -> Double

    Solution::total_time_violation

    source
    fn Solution::total_time_violation(self : Solution) -> Double

    Solution::unassigned_customers

    source
    fn Solution::unassigned_customers(self : Solution) -> Array[Int]

    Solution::validate

    source
    fn Solution::validate(self : Solution, instance : VrpInstance) -> ValidationReport

    SolveConfig

    source
    pub struct SolveConfig {
      iterations : Int
      local_search_rounds : Int
      segment_length : Int
      min_destroy : Int
      max_destroy : Int
      initial_temperature : Double
      cooling_rate : Double
      capacity_penalty : Double
      time_penalty : Double
      duration_penalty : Double
      unassigned_penalty : Double
    } derive(ToJson, 
    Debug    )

    SolveConfig::default

    source
    fn SolveConfig::default() -> SolveConfig

    SolveConfig::destroy_range

    source
    fn SolveConfig::destroy_range(self : SolveConfig) -> (Int, Int)

    SolveConfig::iteration_budget

    source
    fn SolveConfig::iteration_budget(self : SolveConfig) -> Int

    SolveConfig::local_search_rounds

    source
    fn SolveConfig::local_search_rounds(self : SolveConfig) -> Int

    SolveConfig::penalties

    source
    fn SolveConfig::penalties(self : SolveConfig) -> (Double, Double, Double, Double)

    SolveConfig::tune

    source
    fn SolveConfig::tune(self : SolveConfig, iterations? : Int, local_search_rounds? : Int, segment_length? : Int, min_destroy? : Int, max_destroy? : Int, initial_temperature? : Double, cooling_rate? : Double, capacity_penalty? : Double, time_penalty? : Double, duration_penalty? : Double, unassigned_penalty? : Double) -> SolveConfig

    SolveResult

    source
    pub struct SolveResult {
      instance : VrpInstance
      seed_solution : Solution
      best_solution : Solution
      stats : SolveStats
    } derive(ToJson, 
    Debug    )

    SolveResult::best

    source
    fn SolveResult::best(self : SolveResult) -> Solution

    SolveResult::completion_ratio

    source
    fn SolveResult::completion_ratio(self : SolveResult) -> Double

    SolveResult::improvement

    source
    fn SolveResult::improvement(self : SolveResult) -> Double

    SolveResult::is_improved

    source
    fn SolveResult::is_improved(self : SolveResult) -> Bool

    SolveResult::new

    source
    fn SolveResult::new(instance : VrpInstance, seed_solution : Solution, best_solution : Solution, stats : SolveStats) -> SolveResult

    SolveResult::problem

    source
    fn SolveResult::problem(self : SolveResult) -> VrpInstance

    SolveResult::seed

    source
    fn SolveResult::seed(self : SolveResult) -> Solution

    SolveStats

    source
    pub struct SolveStats {
      iterations : Int
      accepted_moves : Int
      improved_moves : Int
      local_improvements : Int
      evaluated_candidates : Int
      best_iteration : Int
      seed_objective : Double
      best_objective : Double
    } derive(ToJson, 
    Debug    )

    SolveStats::accepted_moves

    source
    fn SolveStats::accepted_moves(self : SolveStats) -> Int

    SolveStats::best_iteration

    source
    fn SolveStats::best_iteration(self : SolveStats) -> Int

    SolveStats::best_objective

    source
    fn SolveStats::best_objective(self : SolveStats) -> Double

    SolveStats::evaluated_candidates

    source
    fn SolveStats::evaluated_candidates(self : SolveStats) -> Int

    SolveStats::improved_moves

    source
    fn SolveStats::improved_moves(self : SolveStats) -> Int

    SolveStats::local_improvements

    source
    fn SolveStats::local_improvements(self : SolveStats) -> Int

    SolveStats::new

    source
    fn SolveStats::new(iterations : Int, accepted_moves : Int, improved_moves : Int, best_iteration : Int, seed_objective : Double, best_objective : Double, local_improvements? : Int, evaluated_candidates? : Int) -> SolveStats

    SolveStats::seed_objective

    source
    fn SolveStats::seed_objective(self : SolveStats) -> Double

    ValidationIssue

    source
    pub(all) enum ValidationIssue {
      InvalidVehicleCapacity
      InvalidFleetSize
      InvalidRouteDuration
      InvalidDepotWindow
      InvalidCustomerWindow(Int)
      NegativeDemand(Int)
      InvalidCoordinate(Int)
      DuplicateExternalId(Int)
      InvalidDistanceMatrix
      TotalDemandExceedsFleet
      TooManyRoutes
      InvalidRouteCustomer(Int)
      DuplicateAssignment(Int)
      AssignmentOverlap(Int)
      MissingAssignment(Int)
      DuplicateUnassignment(Int)
    } derive(Eq, ToJson, 
    Debug    )

    Structural and feasibility diagnostics for instances and solutions.

    ValidationReport

    source
    pub struct ValidationReport {
      valid : Bool
      issues : Array[ValidationIssue]
    } derive(ToJson, 
    Debug    )

    ValidationReport::has_issue

    source
    fn ValidationReport::has_issue(self : ValidationReport, issue : ValidationIssue) -> Bool

    ValidationReport::is_valid

    source
    fn ValidationReport::is_valid(self : ValidationReport) -> Bool

    ValidationReport::issue_count

    source
    fn ValidationReport::issue_count(self : ValidationReport) -> Int

    ValidationReport::issues

    source

    VehicleProfile

    source
    pub struct VehicleProfile {
      capacity : Double
      max_route_duration : Double
      fleet_size : Int
    } derive(ToJson, 
    Debug    )

    VehicleProfile::capacity

    source
    fn VehicleProfile::capacity(self : VehicleProfile) -> Double

    VehicleProfile::capacity_per_route

    source
    fn VehicleProfile::capacity_per_route(self : VehicleProfile) -> Double

    VehicleProfile::fleet_size

    source
    fn VehicleProfile::fleet_size(self : VehicleProfile) -> Int

    VehicleProfile::max_route_duration

    source
    fn VehicleProfile::max_route_duration(self : VehicleProfile) -> Double

    VehicleProfile::new

    source
    fn VehicleProfile::new(capacity : Double, fleet_size? : Int, max_route_duration? : Double) -> VehicleProfile

    VrpInstance

    source
    pub struct VrpInstance {
      name : String
      variant : ProblemVariant
      metric : DistanceMetric
      depot : Depot
      vehicle : VehicleProfile
      customers : Array[Customer]
      distance_matrix : Array[Array[Double]]
    } derive(ToJson, 
    Debug    )

    VrpInstance::average_demand

    source
    fn VrpInstance::average_demand(self : VrpInstance) -> Double

    VrpInstance::customer

    source
    fn VrpInstance::customer(self : VrpInstance, customer_index : Int) -> Customer

    VrpInstance::customer_count

    source
    fn VrpInstance::customer_count(self : VrpInstance) -> Int

    VrpInstance::customer_labels

    source
    fn VrpInstance::customer_labels(self : VrpInstance) -> Array[Int]

    VrpInstance::customers

    source
    fn VrpInstance::customers(self : VrpInstance) -> Array[Customer]

    VrpInstance::depot

    source
    fn VrpInstance::depot(self : VrpInstance) -> Depot

    VrpInstance::depot_index

    source
    fn VrpInstance::depot_index(self : VrpInstance) -> Int

    VrpInstance::distance

    source
    fn VrpInstance::distance(self : VrpInstance, from_index : Int, to_index : Int) -> Double

    VrpInstance::distance_metric

    source
    fn VrpInstance::distance_metric(self : VrpInstance) -> DistanceMetric

    VrpInstance::distance_summary

    source
    fn VrpInstance::distance_summary(self : VrpInstance) -> (Double, Double, Double)

    Returns a compact summary of a matrix for regression tests and diagnostics.

    VrpInstance::fleet_capacity

    source
    fn VrpInstance::fleet_capacity(self : VrpInstance) -> Double

    VrpInstance::has_time_windows

    source
    fn VrpInstance::has_time_windows(self : VrpInstance) -> Bool

    VrpInstance::index_of_label

    source
    fn VrpInstance::index_of_label(self : VrpInstance, label : Int) -> Int?

    VrpInstance::instance_name

    source
    fn VrpInstance::instance_name(self : VrpInstance) -> String

    VrpInstance::is_capacity_feasible

    source
    fn VrpInstance::is_capacity_feasible(self : VrpInstance) -> Bool

    VrpInstance::label_of

    source
    fn VrpInstance::label_of(self : VrpInstance, customer_index : Int) -> Int

    VrpInstance::nearest_customers

    source
    fn VrpInstance::nearest_customers(self : VrpInstance, from_index : Int, limit : Int) -> Array[Int]

    Returns the nearest customer indices, ordered by distance from a point.

    VrpInstance::service_horizon

    source
    fn VrpInstance::service_horizon(self : VrpInstance) -> Double

    VrpInstance::total_demand

    source
    fn VrpInstance::total_demand(self : VrpInstance) -> Double

    VrpInstance::validate

    source
    fn VrpInstance::validate(self : VrpInstance) -> ValidationReport

    VrpInstance::variant

    source
    fn VrpInstance::variant(self : VrpInstance) -> ProblemVariant

    VrpInstance::vehicle

    source
    fn VrpInstance::vehicle(self : VrpInstance) -> VehicleProfile

    all_customer_indices

    source
    fn all_customer_indices(instance : VrpInstance) -> Array[Int]

    analyze_instance

    source
    fn analyze_instance(instance : VrpInstance) -> InstanceStatistics

    Computes demand, geometry, and time-window statistics in one pass.

    assess_solution

    source
    fn assess_solution(instance : VrpInstance, solution : Solution, policy : FeasibilityPolicy) -> FeasibilityAssessment

    Evaluates a solution against a caller-provided tolerance policy.

    best_insertions_for_customer

    source
    fn best_insertions_for_customer(instance : VrpInstance, solution : Solution, customer_index : Int, config : SolveConfig) -> Array[CandidateInsertion]

    build_route

    source
    fn build_route(instance : VrpInstance, stops : Array[Int]) -> RoutePlan

    build_solution

    source
    fn build_solution(instance : VrpInstance, route_stops : Array[Array[Int]], unassigned : Array[Int], config : SolveConfig) -> Solution

    decode_routes

    source
    fn decode_routes(instance : VrpInstance, text : String, config : SolveConfig) -> Solution raise RouteEncodingError

    Decodes the compact route format and assigns every omitted customer to the returned solution's unassigned list.

    empty_solution

    source
    fn empty_solution(instance : VrpInstance, config : SolveConfig) -> Solution

    encode_routes

    source
    fn encode_routes(instance : VrpInstance, solution : Solution) -> String

    Encodes routes as id,id;id,id, using external customer labels.

    evaluate_route

    source
    fn evaluate_route(instance : VrpInstance, stops : Array[Int]) -> RouteMetrics

    feasible_insertions

    source
    fn feasible_insertions(instance : VrpInstance, solution : Solution, customer_index : Int, config : SolveConfig, policy : FeasibilityPolicy) -> Array[CandidateInsertion]

    improve_with_two_opt

    source
    fn improve_with_two_opt(instance : VrpInstance, solution : Solution, config : SolveConfig) -> Solution

    Applies the best improving 2-opt edit found in a solution.

    insertion_delta

    source
    fn insertion_delta(instance : VrpInstance, route : RoutePlan, customer_index : Int, position : Int) -> Double?

    Returns the cost change caused by inserting a stop at a route position.

    instance_signature

    source
    fn instance_signature(instance : VrpInstance) -> String

    Returns a stable identity string for cache keys and benchmark manifests.

    make_instance

    source
    fn make_instance(name : String, variant : ProblemVariant, depot : Depot, vehicle : VehicleProfile, customers : Array[Customer]) -> VrpInstance

    make_instance_with_metric

    source
    fn make_instance_with_metric(name : String, variant : ProblemVariant, depot : Depot, vehicle : VehicleProfile, customers : Array[Customer], metric : DistanceMetric) -> VrpInstance

    Builds an instance with an explicit distance convention.

    relocate_customer

    source
    fn relocate_customer(instance : VrpInstance, solution : Solution, from_route : Int, from_position : Int, to_route : Int, to_position : Int, config : SolveConfig) -> Solution?

    Moves one customer between route positions and rebuilds all metrics.

    removal_delta

    source
    fn removal_delta(instance : VrpInstance, route : RoutePlan, position : Int) -> Double?

    Returns the cost change caused by removing one stop from a route.

    reverse_route

    source
    fn reverse_route(instance : VrpInstance, solution : Solution, route_index : Int, config : SolveConfig) -> Solution?

    Reverses a complete route when the resulting route remains feasible.

    route_can_accept

    source
    fn route_can_accept(instance : VrpInstance, route : RoutePlan, customer_index : Int, policy : FeasibilityPolicy) -> Bool

    route_customer_overlap

    source
    fn route_customer_overlap(left : RoutePlan, right : RoutePlan) -> Int

    route_metrics_text

    source
    fn route_metrics_text(route : RoutePlan) -> String

    Returns one line of route-level metrics for lightweight logging.

    route_profile

    source
    fn route_profile(instance : VrpInstance, route : RoutePlan) -> RouteProfile

    singleton_solution

    source
    fn singleton_solution(instance : VrpInstance, config : SolveConfig) -> Solution

    solution_duplicate_count

    source
    fn solution_duplicate_count(solution : Solution) -> Int

    solution_route_count_histogram

    source
    fn solution_route_count_histogram(solution : Solution) -> Array[Int]

    solution_route_length_percentiles

    source
    fn solution_route_length_percentiles(solution : Solution) -> (Double, Double, Double)

    solution_signature

    source
    fn solution_signature(instance : VrpInstance, solution : Solution) -> String

    Returns a stable route signature for equality/regression assertions.

    swap_customers

    source
    fn swap_customers(instance : VrpInstance, solution : Solution, left_route : Int, left_position : Int, right_route : Int, right_position : Int, config : SolveConfig) -> Solution?

    Swaps two customer positions, including positions from different routes.

    two_opt_route

    source
    fn two_opt_route(instance : VrpInstance, route : RoutePlan, first : Int, last : Int, config : SolveConfig) -> RoutePlan?

    Applies a 2-opt reversal and returns None for an invalid or infeasible edit.

    validate_instance

    source
    fn validate_instance(instance : VrpInstance) -> ValidationReport

    Checks data invariants without running a solver.

    validate_solution

    source
    fn validate_solution(instance : VrpInstance, solution : Solution) -> ValidationReport

    Checks that every customer is assigned exactly once or explicitly unassigned.

    validation_messages

    source
    fn validation_messages(report : ValidationReport) -> Array[String]

    Source Files

    Powered by MoonBit

    Site sourceReport issueModulesSkillsCLIBuild queueStatistics

    © 2026 mooncakes.io