OptaPlanner is a constraint satisfaction solver. It optimizes business resource planning use cases, such as Vehicle Routing, Employee Rostering, Cloud Optimization, Job Scheduling, Bin Packing and many more. Every organization faces such scheduling puzzles: assign a limited set of constrained resources (employees, assets, time and money) to provide products or services to customers. OptaPlanner optimizes those planning problems to do more business with less resources.
OptaPlanner is a lightweight, embeddable planning engine. It enables normal Java™ programmers to solve optimization problems efficiently. Constraints apply on plain domain objects and can reuse existing code. There’s no need to input difficult mathematical equations. Under the hood, OptaPlanner combines sophisticated optimization heuristics and metaheuristics (such as Tabu Search, Simulated Annealing and Late Acceptance) with very efficient score calculation.
OptaPlanner alternatives and similar libraries
Based on the "Constraint Satisfaction Problem Solver" category.
Alternatively, view OptaPlanner alternatives based on common mentions on social networks and blogs.
Choco5.1 6.5 L3 OptaPlanner VS ChocoAn open-source Java library for Constraint Programming
JaCoP3.6 0.0 L1 OptaPlanner VS JaCoPJava Constraint Programming solver
Sat4JState-of-the-art SAT solver for boolean and optimization problems.
Access the most powerful time series database as a service
* Code Quality Rankings and insights are calculated and provided by Lumnify.
They vary from L1 to L5 with "L5" being the highest.
Do you think we are missing an alternative of OptaPlanner or a related project?