- Clone the repository
- Run the following commands:
- cd src
- python main.py n or python3 main.py n
- where n is the number of iterations.
- All the tests have been carried out for number of iterations as 50, 100, 300, 500 and 1000 and were averaged over 10 trials.
-
Notifications
You must be signed in to change notification settings - Fork 0
meghna-sk/TSP-Using-ACO
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
Solving Travelling Salesman Problem (TSP) using Ant Colony Optimization (ACO) method
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published