AiS Challenge Team Abstract
Team Number: 022
School Name: Clovis High School
Area of Science: Mathematics
Project Title: TSP (Traveling Salesman Problem)
TSP
(The Traveling Salesman Problem)
Our project will be based upon the classic Traveling Salesman Problem. A
basic definition of the TSP is that there are a set number of points
and one must find the shortest distance between n, n being the
variable number of points or cities, that must be reached by the salesman.
We are first going to work on a simplified model and build upon that. We
are going to create a random grid having a certain changeable number of
coordinates. The end goal is to gain a greater
understanding of the problems, algorithms and the
complexity of the traveling salesman.
Variables:
- Number of towns or coordinates
- Diffrent algorithms to find the optimum solution
- Diffrent algorithms to find a "good" solution
Future Goals:
- Comparing optimum vs "good" algorithms (Elapsed time)
- Constraints to the salesman's route
Team Members
Team Mail
Sponsoring Teacher(s)
Project Mentor(s)
- Mrs. Janelle Zamie
- Major Tom Krajci