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: IE170 Lab #9 Mustafa R. Kılın¸ c & Prof. Linderoth IE 170 – Lab #9: Traveling Salesperson Due Date: April 2 1 , 2006. 11AM. 1 Description and Objectives In the next couple of lab session, you will demonstrate your knowledge of graphs, trees, and paths, to develop and implement heuristics for solving one of the most famous IE problems known as Traveling Salesperson Problem (TSP). In the TSP problem, a salesman must visit n cities. There is a cost (let’s say it is proportional to the distance) of traveling from one city to the next. The salesperson wishes to make the tour (a simple cycle that visits each city exactly once) whose total cost is minimum. For a great introduction to the TSP, including some fascinating pictures of what some large optimal tours look like, see http://www.tsp. gatech.edu/ . No one knows a polynomial-time algorithm for solving the TSP. The problem is N P-Hard. If you find a fast algorithm, you win one million dollars. See http://www.claymath.org/ millennium/P vs NP/ . You’re going to use your knowledge and creativity to implement some known heuristics and to design ones of your own. This is a fairly hard lab, but you have two weeks to get it done. Lab Objectives 1. Understand Traveling Salesperson Problem(TSP) 2. Understand 2-approximate algorithm for TSP 3. Understand nearest-neighbor algorithm for TSP 4. Learn to implement algorithms from scratch given appropriate code snippets....
View Full Document
This note was uploaded on 08/06/2008 for the course IE 170 taught by Professor Ralphs during the Spring '07 term at Lehigh University .
- Spring '07
- Systems Engineering