Team: 6
School: Capital High
Area of Science: Algorithmic
Proposal: School: Capital High School
Team:
Ariana Garcia
Arath Garcia
Melissa Gill
Carlos Lopez
Mentors: ---
“The Traveling Salesman Problem†- Proposal
What the problem is (the definition of the problem):
Given a list of locations you have to go to, the traveling salesman problem challenges one to figure out a route the gets to every location and still return to the starting point in the shortest possible route.
Why it is important or what results you hope to get (the purpose of the project):
The importance of this problem is so that people don’t have to waste their time taking a long route to visit a list of locations that they can still visit just using a more simpler and shorter route that saves time, money, and gas.
How you plan to work on it (plan of action or methods):
By creating an algorithm with programs such as NetLogo and Python, we’ll come up with a way that searches for the shortest route possible. We will test different solutions and will choose the best solution that comes close to being the shortest route.
Team Members:
Ariana Garcia
Carlos Lopez Candelas
Melissa Gill
Arath Garcia
Sponsoring Teacher: Irina Cislaru