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

Yuck is a local-search constraint solver with FlatZinc interface

Timefold Solver is an AI constraint solver for Python to optimize the Vehicle Routing Problem, Employee Rostering, Maintenance Scheduling, Task Assignment, School Timetabling, Cloud Optimization, Conference Scheduling, Job Shop Scheduling, Bin Packing and many more planning problems.

C++ lib to perform continuous and combinatorial optimization metaheuristics with parallelism support.

PARCO: Parallel AutoRegressive Combinatorial Optimization

OptiML's contribution to the EURO meets NeurIPS 2022 vehicle routing competition.

Python Solutions to HackerRank problems involving Object-Oriented Programming, Graph Search Algorithms, and Matrices

Pickup and Delivery Problem with Time Windows data from SINTEF (https://www.sintef.no/projectweb/top/pdptw/li-lim-benchmark/) with daily updates

Smart cars transition multi-agent simulator created in Julia

Vehicle Routing Problem with Time Windows data from SINTEF (https://www.sintef.no/projectweb/top/vrptw/homberger-benchmark/) with daily updates

Julia Package for reading Multi-Depot Vehicle Scheduling Problem data files

the route planner that generate an optimized route that covers all the desired locations, suggesting the best sequence to follow

Route Optimization Accelerator helps you run linear optimization tasks to solve vehicle routing and traveling salesman problems. It supports multiple constraints such as capacity constraint, time window constraint, duration constraint, distance constraint and more which can be configured on demand to meet your optimization requirements.

Capacitated Vehicle Routing Problem data from CVRPLIB (http://vrp.atd-lab.inf.puc-rio.br/index.php/en/) with daily updates

Implementation of dynamic vehicle routing (DVR) algorithms in a truely distributed fashion based on ROS 2.

Metaheuristics to compute an optimized solution for the combined MTCVRPTW and DSP problem

Interactive tool for generating geographically accurate definitions of public transport routes.

Algoritmo que mostra a solução para o problema do roteamento de Veículos, podendo ser resolvido por força bruta ou pela a Heurística do vizinho mais próximo. O Grafo utilizado é completo com arestas de pesos randômicos.

Ant Colony Optimization and its Applications