TimefoldAI/timefold-solver

The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.

What it solves

Timefold Solver is designed to solve complex planning and scheduling problems where resources must be allocated efficiently to avoid waste. It handles tasks such as vehicle routing, employee rostering, and school timetabling, where finding the optimal arrangement of tasks and resources is computationally difficult.

How it works

It functions as an AI constraint solver for Java and Kotlin. By defining constraints and the goals of a planning problem, the solver optimizes the arrangement of resources to find the best possible solution based on those constraints.

Who it’s for

Developers using Java or Kotlin who need to integrate automated planning and optimization into their software applications.

Highlights

  • AI-driven constraint solving for planning optimization.
  • Supports a wide range of use cases including cloud optimization, job shop scheduling, and conference scheduling.
  • Available in both an open-source Community Edition and a commercial Enterprise Edition.
  • Built by the original OptaPlanner team.

Related

  • Project
    TimefoldAI/timefold-quickstarts

    A collection of quickstart guides and reference implementations for Timefold Solver, an AI constraint solver for Java and Kotlin used for complex scheduling and routing optimization.

  • Project
    hanruihua/RDA-planner

    An optimization-based MPC motion planner that uses ADMM to enable real-time, collision-free navigation for robots in cluttered environments.

  • Project
    microsoft/conductor

    A CLI tool for defining and running deterministic, version-controlled multi-agent workflows using YAML configurations and the GitHub Copilot SDK.

  • Project
    nrslib/takt

    A CLI tool that orchestrates AI coding agents into repeatable, YAML-defined development workflows with isolated worktrees and explicit review loops.

  • Project
    NVIDIA/cuopt-examples

    A collection of examples and notebooks demonstrating how to use NVIDIA cuOpt, a GPU-accelerated engine for solving complex decision optimization problems like vehicle routing and linear programming.