/312_tsp_group

Primary LanguagePythonMIT LicenseMIT

312 TSP Group Project

For our project, we will be approximating a solution for the Travelling Salesperson Problem using 2-opt as well as a greedy algorithm.

2-opt

The premise of 2-opt is to optimize a quick but bad approximation. For ours, this is done on an initial random solution.

Group Members

  • Jacob T.
  • John T.
  • Jonah S.