jsprit is a java based, open source toolkit for solving rich vehicle routing problems
-
Updated
Sep 19, 2025 - Java
jsprit is a java based, open source toolkit for solving rich vehicle routing problems
AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
Examples are written in Java dedicated to JOpt-TourOptimizer
A collection of algorithms and data structures
A collection of algorithms and data structures
This is all my cs201 homework
Fast and easy solver for a lot of Vehicle Routing constraints
Implementation of Hill Climbing algorithm to Traveling Salesman Problem
A small implementation of three algos (simulated annealing, genetics and taboo) in Java using Jade agents
Genetic Algorithm solution to the traveling salesman problem.
Solving the Travelling Salesman problem with Ant Colony Algorithms, using the Isula Framework
Solving the Travelling Salesman problem with the Ant Colony System algorithm, using the Isula Framework.
AI: First project of the Computer Science third-year about Artificial Intelligence.
Algoritmo do caixeiro viajante em java com a biblioteca jung implementado na aula de tpa
The program provides the products of any cargo company to its customers from the point of departure (dynamically entered by the user). it finds 5 additional shortcuts for the shortest route. The Floyd-Warshall algorithm is used in the solution of the problem.
Traveling Salesman Genetic Algorithm
Traveling Salesman issue
The Scheduling API is designed to optimize the route of a trip with multiple stops.
Traveling salesman solver using Java and Genetic algorithm
Add a description, image, and links to the traveling-salesman topic page so that developers can more easily learn about it.
To associate your repository with the traveling-salesman topic, visit your repo's landing page and select "manage topics."