It can solve many practical routing problems, including those with time window constraints, multiple depots, and reloading. These problems all NP-hard, so PyVRP implements a state-of-the-art metaheuristic solver based on iterated local search. The local search optimisation engine is written in C++. On top of the solver, PyVRP exposes a high-level Python modelling interface. This makes it easy to solve large-scale routing problems from Python, at near-native speeds.
Docs: https://pyvrp.org/
npalli•2w ago
nawouda•1w ago
The NVIDIA article mentions constant time move evaluations using time warp inside their local search. We use the exact same thing. We used to have a genetic algorithm on top of the local search, like NVIDIA, but recently dropped that in favour of iterated local search, because we found that to be stabler, converge faster, and overall easier to reason about.
I think NVIDIA has a great product, and an even better marketing department.
ge0ffrey•5d ago