this m file can Find 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)
Notes:
1. Input error checking included
2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
標簽：
Traveling
Salesman
solution
Problem
上傳時間：
2013-12-22
上傳用戶：ruixue198909
