IMPLEMENTED_NOT_INDEPENDENTLY_VERIFIEDTruck + drone

ALGORITHM ARTICLE

Route-first, split-second

Problem. Build a truck tour and then assign compatible drone sorties.

Core idea. Decompose route construction from synchronization-aware sortie selection.

Procedure

  1. Build an exact or heuristic truck tour.
  2. Enumerate candidate sorties.
  3. Solve the split and evaluate makespan.

Certificate. Canonical operation-level feasibility evaluation.

Data structures and API

from optfin_orlab import TruckDroneProblem

solver = TruckDroneProblem()
result = solver.solve_route_first(...)

Complexity. Depends on route and split modes

Limits. Decomposition can miss a globally integrated optimum.

OPTFIN AUDIT CHECKS

What has to reconcile before this method is trusted.

  • DefinitionProblem, objective, inputs and output are explicit.
  • Data structureThe public API and canonical source path are identified.
  • CorrectnessCanonical operation-level feasibility evaluation.
  • ComplexityDepends on route and split modes
  • Operational limitDecomposition can miss a globally integrated optimum.
  • ReproductionSource, executable test and evidence route remain linked.

LUNA ACADEMIC

Continue this algorithm in one research conversation.

Ask for the paper trail, executable test, source explanation, or a reproducibility plan for Route-first, split-second.

Open Luna for this algorithm

Back to the algorithm blog