A genetic algorithm for solving the Capacited Vehicle Routing Problem with Time Windows
-
Updated
Dec 12, 2018 - Java
A genetic algorithm for solving the Capacited Vehicle Routing Problem with Time Windows
This project presents an approach to solving the Vehicle Routing Problem (VRP) using various metaheuristics. It explores the creation of efficient delivery routes to serve customers while respecting specific constraints, implementing algorithms such as Tabu Search, Simulated Annealing, and Gradient Descent.
Examples are written in Java dedicated to JOpt-TourOptimizer
Examples for using DNA-Evolutions RESTful products
Get started with Timefold quickstarts here. Timefold is the successor of OptaPlanner, by the OptaPlanner team. Optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning problems
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.
Add a description, image, and links to the vrptw topic page so that developers can more easily learn about it.
To associate your repository with the vrptw topic, visit your repo's landing page and select "manage topics."