A collection of algorithms and data structures

AI constraint solver in Java to optimize the vehicle routing problem, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.

jsprit is a java based, open source toolkit for solving rich vehicle routing problems

A population based stochastic algorithm for solving the Traveling Salesman Problem.

A population based stochastic algorithm for solving the Traveling Salesman Problem.

Fast and easy solver for a lot of Vehicle Routing constraints

Solving the Travelling Salesman problem with Ant Colony Algorithms, using the Isula Framework

Examples are written in Java dedicated to JOpt-TourOptimizer

The Scheduling API is designed to optimize the route of a trip with multiple stops.

Ant Colony System algorithm.

AI: First project of the Computer Science third-year about Artificial Intelligence.

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.

Above-average TSP estimater w/ no strict dependencies

Attempting to solve the Traveling Salesman Problem using a Genetic Algorithm with Roulette Wheel Selection and Elitism

Solving the Travelling Salesman problem with the Ant Colony System algorithm, using the Isula Framework.

A small implementation of three algos (simulated annealing, genetics and taboo) in Java using Jade agents

Genetic Algorithm solution to the traveling salesman problem.

Find an approximate solution to the Travelling Salesman Problem (using simulated ant colonies)

A collection of algorithms and data structures