- Category:
- AI-NN-PR
- Tags:
-
[Text]
- File Size:
- 2kb
- Update:
- 2012-11-26
- Downloads:
- 0 Times
- Uploaded by:
- whp9455
Description: Traveling salesman problem: a number of sales going to the city to sell goods, known distance between cities (or passage). He selected one from a resident, goes through each city once, and finally back to the resident' s route, bringing the total distance (or travel) the smallest.
To Search:
File list (Check if you may need any files):
蚂蚁算法程序.txt