The following Matlab project contains the source code and Matlab examples used for fixed endpoints open traveling salesman problem genetic algorithm.
TSPOF_GA Fixed Open Traveling Salesman Problem (TSP) Genetic Algorithm (GA)
Finds a (near) optimal solution to a variation of the TSP by setting up
a GA to search for the shortest route (least distance for the salesman
to travel from a FIXED START to a FIXED END while visiting the other
cities exactly once)