AiS Challenge Team Abstract

Team Number: 022

School Name: Clovis High School

Area of Science: Mathematics

Project Title: TSP (Traveling Salesman Problem)




(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.


Future Goals:

Team Members

Team Mail

Sponsoring Teacher(s)

Project Mentor(s)