🥮 mooncakes.io

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

    ConstructionStrategy

    source
    pub(all) enum ConstructionStrategy {
      ClarkeWright
      NearestNeighbor
      CheapestInsertion
      DemandFirst
      Radial
      Balanced
    } derive(Eq, ToJson, 
    Debug    )

    Construction strategies exposed by the library.

    SavingsCandidate

    source
    type SavingsCandidate derive(
    Debug    )

    SeedQuality

    source
    pub struct SeedQuality {
      strategy : ConstructionStrategy
      objective : Double
      assigned_count : Int
      route_count : Int
      average_stops : Double
      feasible : Bool
    } derive(ToJson, 
    Debug    )

    Quality indicators for comparing constructive heuristics.

    SeedQuality::assigned_count

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

    SeedQuality::average_stops

    source
    fn SeedQuality::average_stops(self : SeedQuality) -> Double

    SeedQuality::is_feasible

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

    SeedQuality::objective

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

    SeedQuality::route_count

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

    SeedQuality::strategy

    source

    balanced_seed

    source

    Chooses the feasible route with the lowest post-insertion load ratio.

    best_seed

    source

    Solves once from each supplied strategy and returns the best result.

    cheapest_insertion_seed

    source

    Repeatedly inserts the customer/position pair with the lowest penalized cost.

    cheapest_route_insertion

    source

    Returns the cheapest feasible insertion in one route.

    clarke_wright_seed

    source

    demand_first_seed

    source

    Builds capacity-first routes, placing large deliveries before small ones.

    demand_ordered_insertion

    source

    Repairs every unassigned customer in order of descending demand.

    evaluate_seed

    source

    insert_customer

    source

    Inserts a customer into the best existing route, creating a route only when the fleet still has an unused vehicle.

    nearest_neighbor_seed

    source

    Builds routes by repeatedly appending the closest feasible customer.

    radial_seed

    source

    Packs customers in radial order, opening a new route at each capacity break.

    seed_by_strategy

    source

    Selects a construction heuristic for applications and benchmarks.

    Source Files

    Powered by MoonBit

    Site sourceReport issueModulesSkillsCLIBuild queueStatistics

    © 2026 mooncakes.io