OptaPlanner is an A.I. constraint solver. It optimizes planning and scheduling problems, such as Vehicle Routing, Employee Rostering, Cloud Optimization, Task Assignment, Conference Scheduling, Job Shop Scheduling, Bin Packing and many more. Every organization faces such challenges: assign a limited set of constrained resources (employees, assets, time and/or money) to provide products or services. OptaPlanner delivers more efficient plans, which reduce costs and improve service quality.
OptaPlanner is a lightweight, embeddable planning engine. It enables normal Java™ programmers to solve optimization problems efficiently. It is also compatible with other JVM languages (such as Kotlin and Scala). Constraints apply on plain domain objects and can call existing code. There’s no need to input constraints as mathematical equations. Under the hood, OptaPlanner combines sophisticated A.I. optimization algorithms (such as Tabu Search, Simulated Annealing, Late Acceptance and other metaheuristics) with very efficient score calculation and other state-of-the-art constraint solving techniques.
OptaPlanner is open source software, released under the Apache Software License. It is written in 100% pure Java™, runs on any JVM and is available in the Maven Central repository too.
-
-
-
examples/runExamples.sh
examples/runExamples.bat
To optimize a problem from Java™ code,
add the optaplanner-core jar and call Solver.solve():
// My domain specific class as input
MyRoster problem = ...;
SolverFactory<MyRoster> factory = SolverFactory
.createFromXmlResource(".../mySolverConfig.xml");
Solver<MyRoster> solver = factory.buildSolver();
// My domain specific class as output
MyRoster solution = solver.solve(problem);
for (MyShift shift : solution.getShifts()) {
// Each shift is now assigned to an employee
assertNotNull(shift.getEmployee());
}
Radovan Synek
Musa Talluzi
Geoffrey De Smet
Musa Talluzi
Radovan Synek
Sudheer Chekka
Musa Talluzi