Description: a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25
To Search:
- [full_duplex] - Full Duplex 1/1/2006 application source
- [expr1] - parts cutting issue for a fixed width of
- [expr3] - problem given a container, its length L,
- [TSP] - Solving Traveling Salesman Problem is kn
- [GA_TSP_lunwen+yuanma] - The use of genetic algorithm to solve TS
File list (Check if you may need any files):
Download