BALDES 2.0
OPEN SOURCE / ROUTING OPTIMIZATION
Solve vehicle routing problems with capacity constraints and time windows. Use Python for root relaxations, the CLI for feasible routes and integer search, or Rust to build your own solver.
A ROUTING SANDBOX
01 / YOUR FIRST SOLVE
Choose your interface. The same Rust engine powers the CLI and Python root solver.
Use HGS to find an integer routing plan within a time budget.
LOWER BOUNDSInspect an LP bound and route columns. Route values may be fractional.
INTEGER SEARCHRun branch-and-price and track the incumbent, bound, and remaining gap.
Clone once, with the bundled Clp sources.
git clone --recurse-submodules https://github.com/lseman/baldes.git
cd baldesThe solver, in your terminal.
cargo install --path . --features clp --locked
baldes --helpFrom the checkout above. Requires Rust/Cargo and a C++14 compiler. Cargo installs baldes into its binary directory; add it to your PATH if needed.
Your data. A Rust-backed solve.
python -m venv .venv
source .venv/bin/activate
python -m pip install .From the same checkout, with Python 3.9+, Rust/Cargo and a C++14 compiler. The source build includes Clp. Activation shown for Linux/macOS shells.
Python installation & API03 / PUT IT TO WORK
Define a depot, add customers, and solve a capacitated routing root relaxation. No instance file required.
Python returns an LP relaxation; routes may have fractional values. Use the CLI or Rust for integer tree search.
Explore the Python APIfrom pybaldes import Customer, Instance
# Depot first, then customers with unit demand.
instance = Instance("first-route", capacity=2, customers=[
Customer(0, 0),
Customer(1, 0, demand=1),
Customer(0, 1, demand=1),
])
result = instance.solve_root(
problem_type="cvrp",
capacity_cuts=True,
)
print(result.status, result.lp)
for route in result.routes:
print(route.value, route.nodes)Run from the checkout after installing the CLI.
baldes vrptw instances/Solomon/R101.txt \
--customers 10 --rank1 --tree --time 60From your own Cargo project, use a path to the cloned source.
cargo add baldes --path ../baldes --features clp02 / INSIDE THE ENGINE
Work with one component, or connect the full routing pipeline. The Rust core uses the standard library; native backends power the master solves.
Bucket graphs organize resource-constrained labels. Forward and backward searches meet, while dominance removes paths that cannot help.
Explore pricingRank-one, capacity, strong k-path, and load-knapsack cuts strengthen the relaxation, with their dual effects carried into pricing.
Meet the cut familiesChildren inherit the solved master, cuts, and pricing state. Ryan–Foster and vehicle-count branches work with the single-network tree.
Follow a node03 / OPEN THE NOTEBOOK
Ryan–Foster, vehicle counts, arc flow, and what network assignment really requires.
ALGORITHMSFollow smoothing weights, center updates, and the retry back to raw master duals.
REFERENCESupported BALDES options, their defaults, and where each control applies.