Optimization & simulation · Google

Google OR-Tools

Open-source optimization suite for routing, linear, integer and constraint programming problems.

OR-Tools is a free, open-source library of solvers and algorithms for combinatorial optimization: vehicle routing, bin packing, scheduling, network flow, linear programming and mixed-integer programming. Its best-known component is CP-SAT, a constraint-programming solver that has placed first in international CP competitions and is a common default for scheduling and routing work. OR-Tools can call its own bundled solvers (GLOP for linear programming, CP-SAT for constraint programming) or hand a problem off to an external commercial solver such as Gurobi, CPLEX or Xpress through a common interface. It ships APIs for Python, C++, Java and C#, runs anywhere those languages run, and requires no license or purchase, making it the usual first stop for teams that want to try mathematical optimization before buying a commercial solver.

At a glance

Vendor Google
Pricing model Open source + paid options
Free tier Yes
Deployment Self-hosted
Open source Yes (Apache-2.0)
Best for Engineering teams building routing, scheduling or packing optimization into a product without a commercial solver license.

Pricing

Free and open source; no vendor pricing page.

Pricing has not been verified yet — see the vendor's site.

Features

  • CP-SAT constraint-programming solver
  • Vehicle routing problem (VRP) solver with time windows and capacity constraints
  • GLOP linear-programming solver and MIP wrappers
  • Bin packing and knapsack algorithms
  • Network flow and assignment algorithms
  • Python, C++, Java and C# APIs
  • Pluggable interface to call commercial solvers

Integrations

Profile last reviewed September 21, 2026

Alternatives

Google OR-Tools in the index now

Terms to know

Related guides