Find an approximate solution to the Travelling Salesman Problem (using simulated ant colonies)
-
Updated
Feb 2, 2017 - Java
Find an approximate solution to the Travelling Salesman Problem (using simulated ant colonies)
A population based stochastic algorithm for solving the Traveling Salesman Problem.
A population based stochastic algorithm for solving the Traveling Salesman Problem.
Attempting to solve the Traveling Salesman Problem using a Genetic Algorithm with Roulette Wheel Selection and Elitism
Traveling salesman solver using Java and Genetic algorithm
The Scheduling API is designed to optimize the route of a trip with multiple stops.
Traveling Salesman issue
Traveling Salesman Genetic Algorithm
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.
Algoritmo do caixeiro viajante em java com a biblioteca jung implementado na aula de tpa
AI: First project of the Computer Science third-year about Artificial Intelligence.
Solving the Travelling Salesman problem with the Ant Colony System algorithm, using the Isula Framework.
Solving the Travelling Salesman problem with Ant Colony Algorithms, using the Isula Framework
Genetic Algorithm solution to the traveling salesman problem.
A small implementation of three algos (simulated annealing, genetics and taboo) in Java using Jade agents
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."