Skip to content

Latest commit

 

History

History
11 lines (8 loc) · 256 Bytes

README.md

File metadata and controls

11 lines (8 loc) · 256 Bytes

Travelling-Salesman-Problem

We tried to solve TSP using different heuristcs and metaheurists and compare their accuracy as well as speed.

Heuristics:

  • Greedy Algorythm
  • Minimum Spanning Tree

Metaheuristics:

  • Local Search
  • Tabu Search