Next talk: Solving constraint satisfaction puzzles with OptaPlanner

Published on Apr 25, 2016, Permalink

Mark the date and visit the Euregio JUG at DocMorris' in Heerlen and meet Geoffrey De Smet, project lead of OptaPlanner, a Drools powered constraint satisfaction solver.

What is OptaPlanner?

OptaPlanner is a constraint satisfaction solver. It optimizes business resource planning. Every organization faces scheduling puzzles: assign a limited set of constrained resources (employees, assets, time and money) to provide products or services to customers. OptaPlanner optimizes such planning problems to do more business with less resources. Use cases include Vehicle Routing, Employee Rostering, Job Scheduling, Bin Packing and many more.

About Geoffrey
Geoffrey De Smet

Geoffrey De Smet (Red Hat) is the lead and founder of OptaPlanner. Before joining Red Hat in 2010, he was formerly employed as a Java consultant, an A.I. researcher and an enterprise application project lead. He has contributed to many open source projects (such as drools, jbpm, pressgang, spring-richclient, several maven plugins, weld, arquillian, …). Since he started OptaPlanner in 2006, he’s been passionately addicted to planning optimization.

Abstract of the talk

What’s the shortest trip to visit all European capitals? Or the cheapest vehicle routing schedule to restock all our retail stores? How do we optimize our cloud machines? When do we assign nurses to shifts in our hospitals to make them as happy as possible? Which crops do we plant on which fields for the optimal revenue? What’s the fairest tennis club schedule? Which algorithms work well and scale out on these kind of planning problems? Certainly not Brute Force or other exhaustive heuristics!

In this session, we will:

  • Introduce constraint satisfaction optimization

  • Demo a few use cases

  • Use weighted hard and soft constraints to formalize business goals

  • Walk through a bit of example code in Java of the open source constraint satisfaction solver OptaPlanner (

  • Explain how continuous planning or real-time planning works

  • Deal with scalability challenges by using heuristics and metaheuristics (such as Tabu Search and Simulated Annealing).

When and where

The event will be held on Thursday, June 2nd 2016 at DocMorris in Heerlen:

DocMorris Versand Apotheke

DocMorris Versand Apotheke
Avantisallee 152
6422 RA Heerlen
The Netherlands Google Maps Link

Doors open are 18:00, we plan to start at 18:30.

Admission is free, but you are asked to register here

so that we know how many guests to expect. We will have a raffle of Java-related books from dpunkt.verlag (in german, though) between the preregistered guests before the talk starts. After talk we wrap up with some free drinks together with the speaker, giving you the opportunity to ask him some more questions in private.

Contact us