This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ENGRI 1101 Engineering Applications of OR Fall 2008 Prelab 1 The Traveling Salesman Problem Name: Objectives: Introduce students to a real world problem solved by OR practitioners Demonstrate the use of heuristics to obtain good solutions to optimization problems Give students an appreciation of the difficulty of solving optimization problems exactly Key Ideas: Algorithm Heuristic Optimal Solution Traveling Salesman Problem Tour Improvement Reading Assignment: Read Handout 2 on the traveling salesman problem. PreLab Exercise: (please write your answers on this sheet, and turn it in together with your lab exercises) Consider the drawing on the other side of this page, which is called a graph . The circles represent cities, and are called the nodes of the graph, and the lines connecting pairs of nodes are called edges . To determine the distance between a pair of points, one simply considers the sum of the vertical distance and the horizontal between the two nodes, where the length of each edge is 1. For example, the distance between the nodesbetween the two nodes, where the length of each edge is 1....
View
Full
Document
This note was uploaded on 09/30/2008 for the course ENGRI 1101 taught by Professor Trotter during the Fall '05 term at Cornell University (Engineering School).
 Fall '05
 TROTTER

Click to edit the document details