An open-source optimization toolkit for routing, scheduling, assignment, and constrained planning. Builders specify objectives and constraints rather than train
Last reviewed: 2026-10-03
OR-Tools is a toolkit for combinatorial optimization. It includes routing, constraint-programming, and mathematical-optimization tools accessed through supported programming languages. A solver searches the model you specify, so the meaning of a good result depends on the objective and constraints.
Start with a small delivery-routing example where the expected feasible routes are understandable. Model capacity, travel time, and delivery windows separately. Inspect feasibility and solver status, and retain a fallback plan when the constraints cannot all be satisfied.
It solves an optimization model that you define. Historical data can inform travel estimates, but the toolkit does not automatically infer every business constraint.
Inspect the returned status. A model may be infeasible, or the solver may not find a solution within its limits; those cases require different handling.