🥮 mooncakes.io

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

    ImprovementReport

    source
    pub struct ImprovementReport {
      solution : 
    Solution
      rounds : Int
      moves : Int
      start_objective : Double
      final_objective : Double
    } derive(ToJson, 
    Debug    )

    ImprovementReport::final_objective

    source
    fn ImprovementReport::final_objective(self : ImprovementReport) -> Double

    ImprovementReport::moves

    source
    fn ImprovementReport::moves(self : ImprovementReport) -> Int

    ImprovementReport::new

    source
    fn ImprovementReport::new(solution : 
    Solution    , rounds : Int, moves : Int, start_objective : Double, final_objective : Double) -> ImprovementReport

    ImprovementReport::rounds

    source
    fn ImprovementReport::rounds(self : ImprovementReport) -> Int

    ImprovementReport::solution

    source

    ImprovementReport::start_objective

    source
    fn ImprovementReport::start_objective(self : ImprovementReport) -> Double

    NeighborhoodKind

    source
    pub(all) enum NeighborhoodKind {
      TwoOpt
      Relocate
      Swap
      Reverse
    } derive(Eq, ToJson, 
    Debug    )

    Neighborhoods implemented by the local improvement layer.

    RelatednessWeights

    source
    pub struct RelatednessWeights {
      distance : Double
      demand : Double
      time_window : Double
      service : Double
    } derive(ToJson, 
    Debug    )

    Weights used when ranking related customers for destroy operators.

    RelatednessWeights::default

    source

    RelatednessWeights::demand

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

    RelatednessWeights::distance

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

    RelatednessWeights::service

    source
    fn RelatednessWeights::service(self : RelatednessWeights) -> Double

    RelatednessWeights::time_window

    source
    fn RelatednessWeights::time_window(self : RelatednessWeights) -> Double

    RelatednessWeights::tune

    source
    fn RelatednessWeights::tune(self : RelatednessWeights, distance? : Double, demand? : Double, time_window? : Double, service? : Double) -> RelatednessWeights

    best_relocate

    source

    Searches all single-customer relocations and keeps the best strict improvement.

    best_reverse

    source

    Searches a complete route reversal neighborhood.

    best_swap

    source

    Searches all swaps between route positions and keeps the best improvement.

    demand_first_repair

    source

    Repairs large deliveries first, reducing late capacity failures.

    destroy_fraction

    source

    Removes a bounded fraction of assigned stops with a selected strategy.

    destroy_solution

    source

    greedy_repair

    source

    operator_candidate_score

    source
    fn operator_candidate_score(instance : 
    VrpInstance    , solution : 
    Solution    , balance_weight : Double) -> Double

    Scores a candidate with a quality/constraint trade-off for dashboards.
    fn rank_related_customers(instance : 
    VrpInstance    , seed : Int, candidates : Array[Int], weights : RelatednessWeights) -> Array[Int]

    Returns customer indices ordered from most to least related to a seed.

    regret2_repair

    source

    relatedness_score

    source
    fn relatedness_score(instance : 
    VrpInstance    , left : Int, right : Int, weights : RelatednessWeights) -> Double

    Scores two customers by spatial, demand, and temporal similarity.

    repair_solution

    source

    repair_until_stable

    source

    Repeatedly applies greedy repair until no unassigned count changes.

    repair_with_priority

    source

    Selects a repair order according to the structure of the instance.

    route_balance_score

    source

    Measures how evenly a solution uses its vehicle capacities.

    select_operator

    source
    fn select_operator(scores : Array[Double]) -> Int

    Selects a destroy operator from a score vector with deterministic tie breaks.

    time_window_repair

    source

    Repairs tight time windows before relaxed deliveries.

    variable_neighborhood_descent

    source

    Runs a bounded variable-neighborhood descent over the core move operators.

    variable_neighborhood_report

    source

    Same search as variable_neighborhood_descent, with useful run statistics.

    Source Files

    Powered by MoonBit

    Site sourceReport issueModulesSkillsCLIBuild queueStatistics

    © 2026 mooncakes.io