Skip to content

Latest commit

 

History

History
12 lines (9 loc) · 539 Bytes

README.md

File metadata and controls

12 lines (9 loc) · 539 Bytes

IT300 DAA Project: Travelling Salesman Problem Using Ant Colony Optimization

Solving Travelling Salesman Problem (TSP) using Ant Colony Optimization (ACO) method

The Base Paper is attached in the 'src' folder

  • 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.