Travelling-Salesman-Problem Algorithms

Some Local Search algorithms and their complexity on the Travelling Salesman Problem including

• Hill Climbing
• Simulated Annealing
• Local Beam Search
• Genetic Algorithm

How to run this project

1. install all dependencies

2. clone this project

   • numpy
   • matplotlib

3. run the project

   1. Now run the project on the travelling-salesman/src/ directory with python3 run.py

   2. or create a new TSP-Object and test the methods yourself
      

   tsp_obj = TSP(num_cities, avg_dist_val)

   tsp_obj.calc_points_dist()

TODO's

• add algorithm variants
• modify run file
• add efficiency or comparison file