Analysis of the Traveling Salesman Problem

The Objective

To determine the cheapest route when flying between five cities.

Methods/Materials

Using Internet Explorer and the website Expedia.com, five cites were selected.

A calender provided dates of travel with one business day stop-over at each city.

I then used the Brute Force Method to determine if a pattern exicted.

Pricing data was collected for each location and a tree diagram was used to interpret the information.

Results

No definite pattern emerged.

In seven out of ten trials, one route proved to be the cheapest.

While four out of ten trials showed another was cheaper.

Conclusions/Discussion

Although no definite pattern emerged, traveling in a circular pattern between cities resulted in lower prices.

Without using the Brute Force Method, there is no distinct pattern to find the cheapest route between five cities.

Science Fair Project done By Azhia C. Haga

 

 

<<Back To Topics Page...................................................................................>>Next Topic

Related Projects :

Correlation between Height and Stride Length
Efficient Algorithm Solving Alexander Star
Artificial Neural Networks
Area of an Arbelos
Fibonacci and Phyllotaxis
Morphing Circles with Trig
Taking It to the Edge

 

 

 

Copyright © www.sciencefairexperiments.org 2012 through 2016

Designed & Developed by Big Brothers