Constraint solving in Java with OptaPlanner

10th July 2017 in London at CodeNode

This SkillsCast was filmed at Constraint solving in Java with OptaPlanner

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 ( [1])

  • 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).


Thanks to our sponsors

Constraint solving in Java with OptaPlanner

Geoffrey De Smet

Geoffrey De Smet is the founder and project lead of OptaPlanner, the leading open source constraint satisfaction solver in Java. He enjoys assisting developers optimize challenging planning problems of real-world enterprises. He also participates regularly in academic competitions. He started coding Java in 1999 and he regularly contributes to other open source projects too.