fairfolio
Saved Projects

Oh, The Places You'll Go: A Statistical Analysis of the Traveling Salesman Problem

CSEF · 2008 Mathematics & Software

Azhia C. Haga · Palm Springs High School, Palm Springs, Riverside County

Overview

Objectives/Goals 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.

Summary statement

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

Help received

Dad helped create mechanism for keeping boards together.

Competition history

  • CSEF 2008 Mathematics & Software · Entry S1307

Resources

Related projects

Closest projects by meaning, across every fair and year in the corpus.

Browse more like this

Source: California Science & Engineering Fair public projects

Save projects to your library

Sign in with Google to keep track of projects you find interesting, organized into folders. An account also raises your daily allowance for “Has this been done?”, and lets you create a key for the MCP server with a much higher limit than anonymous use. Browsing stays public.

Continue with Google