The Traveling Salesman Problem
I did research on the Traveling Salesman Problem, or TSP. Attached below is a worksheet that explains the TSP and an example of it. The TSP looks at a set of given points and the distances between those points and finds the fastest way to visit all of those points without repeating a stop. The solution involves using permutations to determine every possible route and then solving for values of those permutations so a shortest route can be determined.
coordinating_seminar_final_worksheet.docx | |
File Size: | 90 kb |
File Type: | docx |
coordinating_seminar_final.pptx | |
File Size: | 58 kb |
File Type: | pptx |