|
又一个,还是在 http://www.aspenleaf.com/distributed/distrib-recent.html 页面发现的:
---------------------------------------------------------------------------------------------------
The fourth challenge was World TSP, a study of the Traveling Salesman Problem (http://www.math.princeton.edu/tsp/ ). This challenge attempted to find the shortest route which visits all 1,904,711 populated cities and towns on Earth. "The current best lower bound on the length of a tour for the World TSP [was] 7,510,666,782 (Kilometers)." This bound was established on June 18, 2002. The challenge used an evolving artificial intelligence algorithm to attempt to beat that bound. With 97,820 total routes completed, the shortest route discovered was 13,802,932,609 Kilometers.
-------------------------------------------------------------------------------------------------------
其大意是:
第四个挑战是世界TSP,研究Traveling Salesman Problem(旅游推销商问题)。这个挑战试图找出参观地球上所有的近1,904,711个可供居住的城市和城镇的最近路线。“当时世界TSP最短的游览线路长度是7,510,666,782公里。”这个极限值是2002年6月18日得到的,该挑战试图使用一种改进的智能算法突破那个极限值。在完成了97,820条路线测试后, 得到的最近线路长是13,802,932,609公里。
[ Last edited by 碧城仙 on 2005-1-17 at 05:50 PM ] |
|