Vehicle Routing Problem (VRP) solver with Large Neighborhood Search (LNS)
A number of total cases is (s + v - 1)! / (v - 1)!
where s
is a number of stops and v
is a number of vehicles.
Note that those are currently equivalent to a brute force one unless you provide a cost calculator that may return infinity or computes proper lower bounds.
cargo run --release --features trace --bin ruin_and_recreate
graphhopper/jsprit
reinterpretcat/vrp