prelab 1 - point in the shortest possible number of edges....

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Jordan Hauer 9/6/04 Engri 115 Prelab #1 The Traveling Salesman Problem 1. 2. 48 nodes 3. The difficulties I encountered in choosing the tour was trying to find the path that visits all nodes and ends up closest to the starting node as possible. 4. I mostly just eyeballed it and used guess and check. I tried a few different routes. 5. This is the shortest or optimal tour because it visits all nodes and ends up at the starting
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: point in the shortest possible number of edges. 6. This solution is one of many that I found that had the same number of steps. Therefore, it is one of many optimal solutions, or there is a better solution, which I had not thought of. It is not, as in the first example, the least possible number of edges in a solution....
View Full Document

This lab report was uploaded on 02/19/2008 for the course CHEM 211 taught by Professor Crane, b during the Fall '06 term at Cornell.

Page1 / 2

prelab 1 - point in the shortest possible number of edges....

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online