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/