遗传算法和“货郎担” 问题:
"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."
标签：
traveling
salesman
problem
finite
上传时间：
2013-12-24
上传用户：watch100
