CS325 Anaylsis of Algorithms [Project]
This is a traveling salesman problem. Using the Nearest Neighbours Algorithm. The source file is the TSP.cpp file. The rest of the files with test-input-#.txt are uses for testing the TSP.cpp algorithm. Once finished a test-input-#.txt.tour will be created where it will contain information of the shortest distance acheivable.
https://github.com/VictorCam/CS325_TSP/blob/master/Project%20Report%20CS325.pdf
-
g++ -std=c++11 TSP.cpp
-
./a.out test-input-[number].txt
-
test-input-[number].txt.tour will be created
- Accept problem instances on the command line.
- Name the output file as the input file’s name with .tour appended (for example input tsp_example_1.txt will output tsp_example_1.txt.tour).
- Compile/Execute correctly and without debugging on the flip server according to specifications and any documentation you provide
-
A problem instance will always be given to you as a text file
-
Each line defines a city and each line has three numbers separated by a white space
-
The first number is a city identifier
-
The second number is the city's x-coordinates
-
The third number is the city's y-coordinates
-
You must output your solution in another text file with n+1 lines, where n is the number of cities.
-
The first line is the length of the tour your program computes.
-
The next n lines should contain the city identifier in the order they are visited by your tour.
-
Each city must be listed exactly once in this list.
-
This is the certificate for your solution and your solutions will be checked. I they are not valid you will not receive credit for them.
- Does your program correctly compute tour lengths for simple cases?
- Does your program read input files and options from the command line?
- Does your program meet the output specifications?
- Did you check that you produce solutions that verify correctly?
- Did you find solutions to the example instances?
- Did you find solutions to the test instances?
- Does your code compile/run without issue according to your documentation?
- Have you submitted your report to Canvas? In the comment section post the onid username of the person who submitted to TEACH.
- Have you submitted your solutions to the test cases, your source code and README file to TEACH?
Post your "best" tour for each test case to the competition discussion board by Friday at 11:59 pm. The minimum tour for each test case will be verified. If the tours are valid the winning team will receive extra credit points. The amount of extra credit depends on whether a team wins multiple test cases. For winning one test case your team members will receive 3 points extra credit to be used towards a project score. For two winning test cases your team will receive 5 points and for more than two 10 points. This may result in over 100% for your project grade.