1 / 6

Traveling Salesman Problem

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.

wylie
Télécharger la présentation

Traveling Salesman Problem

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. Traveling Salesman Problem Study Guide for ES205 Yu-Chi Ho Jonathan T. Lee Xiaocang Lin Sep. 1, 2000

  2. 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.

  3. Example The optimal route for 13,509 cities in the USA with populations > 500 [Applegate et al. 1998].

  4. N Applications • Circuit board designs • Deliveries • Others

  5. N c b d a e Difficulty • For N cities, there are (N-1)! number of possibilities — exponential growth.

  6. 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

More Related