The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.

Get started with Timefold quickstarts here. Optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems.

OptaPlanner quick starts for AI optimization: many use cases shown in many different technologies.

The Multi-Capacity and Multi-Level Localization Project tackles the complex problem of finding optimal locations for elements such as factories while considering multiple capacity levels, assignment constraints, and budget limitations. By integrating two distinct models—multi-capacity localization with budget constraints and multi-level assignment

Clarabel Solver for Java

ECOS Solver for Java

HiGHS Solver for Java

SCIP Solver for Java

Traveling Salesman Problem Framework

A multi-threading java implementation of meta-heuristic algorithms

This repository contains the Vehicle Routing Problem with Time Windows and Delivery Robots (VRPTWDR), inspired by the work of Chen et al. (2021). The project uses Java to implement an Adaptive Large Neighborhood Search (ALNS) heuristic for solving the problem and compares the performance with solutions obtained via the Gurobi optimizer.

SCIP Solver for Java Native Libraries

HiGHS Solver for Java Native Libraries

Clarabel Solver for Java Native Libraries

ECOS Solver for Java Native Libraries

Bin packing problem - Java 13 with Vavr

Load Distribution - A coursework project to use Genetic Algorithms to optimise load distribution in a container ship

Library to easily generate fixed MPS files for LP solvers