This project consists on the usage of the Ant colony optimization meta-heuristic algorithm to find an optimal solution to the Travelling Salesman Problem. The simulation process consists on a group of ants transversing the graph to find Hamiltonian cycles and returning to the nest. The shortest path found is saved and returned to the user.
-
Notifications
You must be signed in to change notification settings - Fork 0
francisco3511/travelling-salesman-problem
About
Ant colony optimization algorithm (ACO) applied to travelling salesman problem.
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published