LLMs can't optimize schedules, but AI can! by Tom Cools
This title could be clearer and more informative.Try out Clickbait Shieldfor free (5 uses left this month).
LLMs struggle with combinatorial planning problems like nurse scheduling because the search space is astronomically large (30^150 possible assignments) and cannot be solved by next-token prediction or sequential reasoning. Mathematical optimization, specifically metaheuristics via the Timefold Solver framework, is the right tool for these problems. A live demo shows how to model a nurse scheduling problem in plain Java with annotated domain classes and constraint definitions (hard and soft constraints), letting Timefold explore 20,000+ moves per second to find optimal schedules. Real-world impact is illustrated with a customer achieving 25% reduction in driving time, saving $100M and 10M kg of CO2 annually. The talk also covers integrating LLMs with Timefold via agents (LangChain4j), PlantUML-based code generation, and AlphaEvolve-style code improvement loops, arguing that GenAI and classical AI techniques are most powerful when combined.
Sort: