Search - Traveling Salesman Problem by GA

Search - Traveling Salesman Problem by GA - List

[Mathimatics-Numerical algorithms] 旅行商问题 DL : 0: % MTSPF_GA Fixed Multiple Traveling Salesmen Problem (M-TSP) Genetic Algorithm (GA) % Finds a (near) optimal solution to a variation of the M-TSP by setting % up a GA to search for the shortest route (least distance needed for % each salesman to travel from the start location to individual cities % and back to the original starting place)
Date : 2011-03-06 Size : 3.96kb User : 5501018333@qq.com