“Vehicle routing is one of the most studied problems in combinatorial optimization. For over six decades, researchers from mathematics, computer science and operations research have produced algorithms that reach near-optimal solutions in acceptable time, even at large scale. But most are designed for one clean VRP variant. Real operations are messier: multiple objectives, and a rich set of soft and hard constraints that change from one customer to the next.
What is actually needed is a solver flexible enough to absorb all of it, modular enough to fit each customer's business logic, and robust enough to run in production, while still performing at the same level as state-of-the-art academic algorithms. We built TQrouting to close that gap: between what the academic VRP community has achieved and what a real operation requires.”