100 likes | 314 Views
Traveling Salesman Problem. Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Xiaocang Lin Sep. 1, 2000. N. c. b. d. a. e. Problem Statement.
E N D
Traveling Salesman Problem Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Xiaocang Lin Sep. 1, 2000
N c b d a e Problem Statement • Given a finite number of cities along with the distance/cost between each pair of them, find the shortest route to travel through all of them and to return to the starting city.
Example The optimal route for 13,509 cities in the USA with populations > 500 [Applegate et al. 1998].
N Applications • Circuit board designs • Deliveries • Others
N c b d a e Difficulty • For N cities, there are (N-1)! number of possibilities — exponential growth.
References: • Chvátal, V., The Traveling Salesman Problem, homepage, http://www.cs.rutgers.edu/~chvatal/tsp.html • Applegate, D., R. Bixby, V. Chvátal and W. Cook, Traveling Salesman Problem, homepage, http://www.keck.caam.rice.edu/tsp/index.html