OptaPlanner: Optimizing vehicle routes, shift rosters and other NP-hard problems

Sep 25, 2014 · Bruxelles, Belgium

The[masked] season is now OPEN!

Hi everyone,

We hope you had time for some great holidays during this summer and that your are now fully charged for a new round.

Our first meeting  for this season has some interesting materials as you'll discover below. We hope to see you numerous there, and don't forget to spread the news in your office, to your friends and, if you cannot attend, to your enemies!

Have a nice day,
The BruJUG team.


Geoffrey De Smet


The world is full of planning problems. Whether your company is scheduling employees to shifts, delivery routes to vehicles, aircraft/crews to flights, courses to timeslots/rooms, manufacturing jobs to machines, you want optimize those schedules:

• fulfill all your business needs, adhere to all constraints;

• minimize cost, maximize profit; 

• maximize customer satisfaction, maximize employee happiness

And you need to respond in real-time with the best planning as circumstances change - equipment breaks, the weather changes or staff call in sick.

Which algorithms can we use to optimize these use cases? How do those algorithms work? How do we scale out? And how much does this reduce our company’s expenses (and ecological footprint)?

OptaPlanner is an open source, lightweight, embeddable planning engine written in Java. It helps normal Java programmers solve constraint satisfaction problems efficiently. Under the hood, it combines optimization heuristics and metaheuristics with very efficient score calculation. For more information, see www.optaplanner.org.

Event organizers

based on 0 reviews