Description: TSP_GA Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to the TSP by setting up a GA to search
for the shortest route (least distance for the salesman to travel to
each city exactly once and return to the starting city)
Summary:
1. A single salesman travels to each of the cities and completes the
route by returning to the city he started from
2. Each city is visited by the salesman exactly once
To Search:
File list (Check if you may need any files):
tsp_ga.m
Download