Finds a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once)
标签：
Traveling
Salesman
solution
Problem
上传时间：
2013-12-04
上传用户：从此走出阴霾
