Description: Written by using genetic algorithms for solving TSP problems, four cases: more than a single starting point for traveling salesman, multi-traveling salesman more than a starting point, a single traveling salesman to the coordinates of points with distance matrix calculation and the calculation
File list (Check if you may need any files):
GATSP\TSP\GAMTSP\data.txt
.....\...\......\mtsp_ga.m
.....\...\......\ReadMe.txt
.....\...\......F\data.txt
.....\...\.......\mtspf_ga.m
.....\...\.......\ReadMe.txt
.....\...\..TSPdistance\data.txt
.....\...\.............\GA_01.m
.....\...\.............\GA_01_fitnessvalue.m
.....\...\.............\GA_TSP.m
.....\...\.............\GA_TSP_fitnessvalue.m
.....\...\.............\GA_TSP_intercross.m
.....\...\.............\GA_TSP_julijisuan.m
.....\...\.............\GA_TSP_length.m
.....\...\.............\ReadMe.txt
.....\...\.............\test.m
.....\...\.....point\data.txt
.....\...\..........\ReadMe.asv
.....\...\..........\ReadMe.txt
.....\...\..........\tsp_ga.m
.....\...\GAMTSP
.....\...\GAMTSPF
.....\...\GATSPdistance
.....\...\GATSPpoint
.....\TSP
GATSP
Download