遺傳算法和“貨郎擔(dān)” 問(wèn)題:
"The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
標(biāo)簽：
traveling
salesman
problem
finite
上傳時(shí)間：
2013-12-24
上傳用戶(hù)：watch100
