Ed Anderson
Joined: 10 Jan 2006 Posts: 475
|
Posted: Sun Jun 17, 2007 6:15 am Post subject: Traveling Salesman Problem was : NC Airports - 110 destinati |
|
|
Here is an example of a larger TSP problem that took 15.7 CPU YEARS to solve in 2005, presumable 110 nodes would take a few years less {:>)
In March 2005, the traveling salesman problem of visiting all 33,810 points in a circuit board was solved using CONCORDE: a tour of length 66,048,945 units was found and it was proven that no shorter tour exists. The computation took approximately 15.7 CPU years (Cook et al. 2006).
http://en.wikipedia.org/wiki/Travelling_salesman_problem#Exact_algorithms
Ed
[quote] ---
| - The Matronics RVSouthEast-List Email Forum - | | Use the List Feature Navigator to browse the many List utilities available such as the Email Subscriptions page, Archive Search & Download, 7-Day Browse, Chat, FAQ, Photoshare, and much more:
http://www.matronics.com/Navigator?RVSouthEast-List |
|
_________________ Ed Anderson
Rv-6A N494BW Rotary Powered
Matthews, NC
eanderson@carolina.rr.com |
|