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
上傳用戶：從此走出陰霾
