Description: Traveling salesman problem using genetic algorithm traveling salesman problem, namely, the problem TSP (Travelling Salesman Problem) is one of the famous field of mathematics. Suppose a business trip to visit n cities, he must choose the path to go, pass through the restriction is to visit each city only once, and finally go back to the original departure city. Path selection objective is to get the path distance to the minimum value among all paths.
File list (Check if you may need any files):
TSP\20071202.txt
...\20071212.txt
...\20071214.txt
...\exchange.m
...\fit.m
...\GA.m
...\GA2.m
...\geneticTSP.m
...\geneticTSP2.m
...\immuni.m
...\intercross.m
...\juli.m
...\mutate.m
...\myLength.m
...\plotaiwa.m
...\新建 文本文档.txt
...\说明.txt
TSP
Download