Skip to content
/ 2-Opt-Solution-for-TSP Public

This repo is for the CS 325 Final Project. Specifically, it is an implementation of the 2-Opt algorithm for the TSP.

3 stars 4 forks Branches Tags Activity
Star
Notifications You must be signed in to change notification settings

ehean/2-Opt-Solution-for-TSP

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

20 Commits
tsp_test_cases
tsp_test_cases
 
 
2opt_research.docx
2opt_research.docx
 
 
README.md
README.md
 
 
TSPAllVisited.py
TSPAllVisited.py
 
 
TSPAllVisited.pyc
TSPAllVisited.pyc
 
 
main.py
main.py
 
 
test_simulated_annealing.py
test_simulated_annealing.py
 
 
time_tests.txt
time_tests.txt
 
 
tsp-verifier.py
tsp-verifier.py
 
 
tsp_example_1.txt
tsp_example_1.txt
 
 
tsp_example_2.txt
tsp_example_2.txt
 
 
tsp_example_3.txt
tsp_example_3.txt
 
 
watch.py
watch.py
 
 

Repository files navigation

2-Opt-Solution-for-TSP

This repo is for the CS 325 Final Project. Specifically, it is an implementation of the 2-Opt algorithm for the TSP.

About

This repo is for the CS 325 Final Project. Specifically, it is an implementation of the 2-Opt algorithm for the TSP.

Resources

Readme
Activity

Stars

3 stars

Watchers

3 watching

Forks

4 forks
Report repository

Releases

No releases published

Packages

 
 
 

Contributors 3

  •  
  •  
  •  

Languages