1 / 5

Unlocking Solutions: The Travelling Salesman Problem Demystified

Explore the Travelling Salesman Problem, where you visit each city once to minimize travel distance. Learn how to tackle the puzzle and calculate possible routes efficiently with factorial math. Dive into the applications in biology for computing DNA sequences and optimizing satellite targeting in NASA Starlight program.

aarmendariz
Download Presentation

Unlocking Solutions: The Travelling Salesman Problem Demystified

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Solving Complex Problems The Travelling Salesman Problem Module 7- Solving Complex Problems

  2. The Travelling Salesman Problem • For a given set of cites, visit each city once and minimise the distance you travel. • We will explore the puzzle http://www.tinyurl.com/salesman1

  3. How many possible routes? Remember it takes (n-1)! moves where n=number of cities E.G. For 10 cities (n-1)! = (10-1)! = 9! = 9x8x7x6x5x4x3x2x1

  4. How much time does it take? These calculations are based on a computer being able to execute 1 million instructions per second

  5. Not just for The Travelling Salesman • Used in Biology to compute DNA sequences. • A Travelling Salesman algorithm is used to minimise the use of fuel in targeting and imaging manoeuvres for the pair of satellites involved in NASA Starlight space interferometer program.

More Related