1 / 13

Optimal Tours of Traveling Salesman Problems in Historical Context

Explore the evolution of TSP solutions from 33 to 15,112 cities around the world, with milestones like the 1962 Proctor and Gamble contest and the latest advancements.

mistico-harold
Download Presentation

Optimal Tours of Traveling Salesman Problems in Historical Context

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

  2. 49 cities 120 cities • Dantzig, Fulkerson, • and Johnson (1954) • Groetschel (1977). • Padberg and Rinaldi (1987) • 532 AT&T switch locations. • Groetschel and Holland (1987) tour of 666 interesting places. Proctor and Gamble ran a contest in 1962. The contest required solving a TSP on a specified 33 cities. There was a tie between many people who found the optimum. • Padberg and Rinaldi (1987) tour through a layout of 2,392 that was obtained from Tektronics Incorporated. • Applegate, Bixby, Chvátal, and Cook (1994) tour for a 7,397-city TSP that arose in a programmable logic array application at AT&T Bell Laboratories. The traveling salesman problem on the WWW • http://www.math.princeton.edu/tsp/index.html • http://www.cs.rutgers.edu/~chvatal/tsp.html

  3. Applegate, Bixby, Chvátal, and Cook (1998) found the optimal tour of the 13,509 cities in the USA with populations greater than 500. • Applegate, Bixby, Chvátal, and Cook (2001) • found the optimal tour of 15,112 cities in Germany

More Related